Generalized connectivity of graphs /

Generalized connectivity of graphs /

Saved in:

Bibliographic Details
Author / Creator:	Li, X. (Xueliang), 1958- author.
Imprint:	Switzerland : Springer, 2016.
Description:	1 online resource (x, 143 pages) : illustrations (some color)
Language:	English
Series:	SpringerBriefs in mathematics, 2191-8198 SpringerBriefs in mathematics.
Subject:	Graph connectivity. Computer science -- Mathematics. Combinatorial analysis. Graph theory. Combinatorial analysis. Computer science -- Mathematics. Graph connectivity. Graph theory. Electronic books.
Format:	E-Resource Book
URL for this record:	http://pi.lib.uchicago.edu/1001/cat/bib/11264164

Hidden Bibliographic Details
Other authors / contributors:	Mao, Yaping, author.
ISBN:	9783319338286 3319338285 9783319338279 3319338277
Notes:	Includes bibliographical references and index. Online resource; title from PDF title page (SpringerLink, viewed July 12, 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.
Other form:	Print version: 9783319338279 3319338277
Standard no.:	10.1007/978-3-319-33828-6

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.