Authors:
- Brings together results, conjectures, and open problems on generalized connectivity
- Features theoretical and practical analysis for generalized (edge-) connectivity
- Contains essential proofs
- Includes supplementary material: sn.pub/extras
Part of the book series: SpringerBriefs in Mathematics (BRIEFSMATH)
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (9 chapters)
-
Front Matter
-
Back Matter
About this book
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.
Reviews
“The monograph under review is devoted to the exposition of results about the generalized connectivity and generalized edge-connectivity of graphs. … Reading it does not require significant background in the relevant fields, as most concepts are introduced and defined … . I would recommend it for a researcher, graduate student, or senior undergraduate student who has an interest in pursuing research on this subject.” (Joy M. W. Morris, Mathematical Reviews, April, 2017)
“This book is a concise and elegant piece of work on an old yet new topic of combinatorics. … The book may be of interest for those who work with communication networks, graph theory and combinatorial optimizations in general.” (Yilun Shang, zbMATH 1346.05001, 2016)
Authors and Affiliations
-
Center for Combinatorics, Nankai University, Tianjin, China
Xueliang Li, Yaping Mao
Bibliographic Information
Book Title: Generalized Connectivity of Graphs
Authors: Xueliang Li, Yaping Mao
Series Title: SpringerBriefs in Mathematics
DOI: https://doi.org/10.1007/978-3-319-33828-6
Publisher: Springer Cham
eBook Packages: Mathematics and Statistics, Mathematics and Statistics (R0)
Copyright Information: The Author(s) 2016
Softcover ISBN: 978-3-319-33827-9Published: 11 July 2016
eBook ISBN: 978-3-319-33828-6Published: 30 June 2016
Series ISSN: 2191-8198
Series E-ISSN: 2191-8201
Edition Number: 1
Number of Pages: X, 143
Number of Illustrations: 22 b/w illustrations, 6 illustrations in colour
Topics: Graph Theory, Combinatorics, Discrete Mathematics in Computer Science, Operations Research, Management Science