Generalized Connectivity of Graphs

  • Xueliang Li
  • Yaping Mao

Part of the SpringerBriefs in Mathematics book series (BRIEFSMATH)

Table of contents

  1. Front Matter
    Pages i-x
  2. Xueliang Li, Yaping Mao
    Pages 1-13
  3. Xueliang Li, Yaping Mao
    Pages 15-29
  4. Xueliang Li, Yaping Mao
    Pages 31-39
  5. Xueliang Li, Yaping Mao
    Pages 41-57
  6. Xueliang Li, Yaping Mao
    Pages 59-66
  7. Xueliang Li, Yaping Mao
    Pages 67-77
  8. Xueliang Li, Yaping Mao
    Pages 79-88
  9. Xueliang Li, Yaping Mao
    Pages 89-112
  10. Xueliang Li, Yaping Mao
    Pages 113-133
  11. Back Matter
    Pages 135-143

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.


Connectivity of Graphs open problems conjectures rainbow index of graphs Steiner tree edge-connectivity graph product Nordhaus-Gaddum-type result edge-disjoint Steiner trees internally disjoint Steiner trees extremal graph

Authors and affiliations

  • Xueliang Li
    • 1
  • Yaping Mao
    • 2
  1. 1.Center for CombinatoricsNankai UniversityTianjinChina
  2. 2.Center for CombinatoricsNankai UniversityTianjinChina

Bibliographic information