| ISBN |
9783319338286 |
| 기타 표준번호 |
10.1007/978-3-319-33828-6 |
| 청구기호 |
QA166-166.247 |
| 형태사항 |
X, 143 p. 28 illus., 6 illus. in color. online resource.
|
| 언어 |
English |
| 내용 |
1. Introduction -- 2. Results for some graph classes -- 3. Algorithm and complexity -- 4. Sharp bounds of the generalized (edge-) connectivity -- 5. Graphs with given generalized connectivity -- 6. Nordhaus-Gaddum-type results -- 7. Results for graph products -- 8. Maximum generalized local connectivity -- 9. Generalized connectivity for random graphs -- Bibliography.??Index. .
|
| 주제 |
Mathematics.
Computer science --Mathematics.
Operations research.
Management science.
Combinatorics.
Graph theory.
Mathematics.
Graph Theory.
Combinatorics.
Discrete Mathematics in Computer Science.
Operations Research, Management Science.
|
| 보유판 및 특별호 저록 |
Springer eBooks
Printed edition: 9783319338279
|
| QR CODE |
|
