Bibliograph

Generalized Connectivity of Graphs, by Xueliang Li, Yaping Mao

Type

Label

Generalized Connectivity of Graphs, by Xueliang Li, Yaping Mao

Language

eng

resource.imageBitDepth

Literary Form

non fiction

Main title

Generalized Connectivity of Graphs

Medium

electronic resource

Nature of contents

dictionaries

Oclc number

952973292

Responsibility statement

by Xueliang Li, Yaping Mao

Series statement

SpringerBriefs in Mathematics,, 2191-8198Springer eBooks

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.--, Provided by publisher

Table Of 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

Classification

Contributor