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.
Explore Generalized Connectivity of Graphs by Xueliang Li & Yaping Mao on eBooksStore by Arnlweb. Discover book details, reader ratings, reviews, release information, genres, and related digital books available through the iTunes Store.
This book is part of our growing collection of bestselling eBooks, popular digital reading materials, and trending author releases. Readers can explore similar books, discover new authors, and browse related genres including fiction, romance, mystery, fantasy, business, self-help, educational books, and more.
Our platform helps readers discover highly rated digital books optimized for smartphones, tablets, laptops, and desktop devices. Browse fast-loading book pages, reader reviews, and popular recommendations from bestselling authors worldwide.