1 option
Generalized connectivity of graphs / by Xueliang Li, Yaping Mao.
Springer Nature - Springer Mathematics and Statistics eBooks 2016 English International Available online
View online- Format:
- Book
- Author/Creator:
- Li, Xueliang, Author.
- Mao, Yaping., Author.
- Series:
- SpringerBriefs in Mathematics, 2191-8198
- Language:
- English
- Subjects (All):
- Graph theory.
- Combinatorial analysis.
- Computer science—Mathematics.
- Operations research.
- Management science.
- Graph Theory.
- Combinatorics.
- Discrete Mathematics in Computer Science.
- Operations Research, Management Science.
- Local Subjects:
- Graph Theory.
- Combinatorics.
- Discrete Mathematics in Computer Science.
- Operations Research, Management Science.
- Physical Description:
- 1 online resource (148 p.)
- Edition:
- 1st ed. 2016.
- Place of Publication:
- Cham : Springer International Publishing : Imprint: Springer, 2016.
- Summary:
- Noteworthy results, proof techniques, open problems and conjectures in generalized (edge-) connectivity are discussed in this book. Both theoretical and practical analyses for generalized (edge-) connectivity of graphs are provided. Topics covered in this book include: generalized (edge-) connectivity of graph classes, algorithms, computational complexity, sharp bounds, Nordhaus-Gaddum-type results, maximum generalized local connectivity, extremal problems, random graphs, multigraphs, relations with the Steiner tree packing problem and generalizations of connectivity. This book enables graduate students to understand and master a segment of graph theory and combinatorial optimization. Researchers in graph theory, combinatorics, combinatorial optimization, probability, computer science, discrete algorithms, complexity analysis, network design, and the information transferring models will find this book useful in their studies.
- Contents:
- 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. .
- Notes:
- Description based upon print version of record.
- Includes bibliographical references and index.
- ISBN:
- 3-319-33828-5
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.