Generalized connectivity of graphs [electronic resource] / Xueliang Li, Yaping Mao.

Unlimited

Authorized users

Can lend chapters, not whole ebooks

Generalized connectivity of graphs [electronic resource] / Xueliang Li, Yaping Mao.

9783319338286 (electronic book)
3319338285 (electronic book)
9783319338279
3319338277

Switzerland : Springer, 2016.

English

1 online resource (x, 143 pages) : illustrations.

10.1007/978-3-319-33828-6 doi

QA166.243

511/.5

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.

Includes bibliographical references and index.

Access limited to authorized users.

Online resource; title from PDF title page (SpringerLink, viewed July 12, 2016).

SpringerBriefs in mathematics.

Print version: 3319338277

Online Resources > Ebooks
All Resources