Generalized Connectivity of Graphs

Nonfiction, Science & Nature, Mathematics, Combinatorics, Graphic Methods
Cover of the book Generalized Connectivity of Graphs by Xueliang Li, Yaping Mao, Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Xueliang Li, Yaping Mao ISBN: 9783319338286
Publisher: Springer International Publishing Publication: June 30, 2016
Imprint: Springer Language: English
Author: Xueliang Li, Yaping Mao
ISBN: 9783319338286
Publisher: Springer International Publishing
Publication: June 30, 2016
Imprint: Springer
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Springer International Publishing

Cover of the book Disadvantaged Workers by Xueliang Li, Yaping Mao
Cover of the book Machine Learning Control – Taming Nonlinear Dynamics and Turbulence by Xueliang Li, Yaping Mao
Cover of the book The GlobalArctic Handbook by Xueliang Li, Yaping Mao
Cover of the book Communication Excellence by Xueliang Li, Yaping Mao
Cover of the book Barry MacSweeney and the Politics of Post-War British Poetry by Xueliang Li, Yaping Mao
Cover of the book Civil Engineering Applications of Ground Penetrating Radar by Xueliang Li, Yaping Mao
Cover of the book Validation of Evolving Software by Xueliang Li, Yaping Mao
Cover of the book Quantum-Enhanced Nonlinear Spectroscopy by Xueliang Li, Yaping Mao
Cover of the book Black Scholarly Activism between the Academy and Grassroots by Xueliang Li, Yaping Mao
Cover of the book Thermal Performance Modeling of Cross-Flow Heat Exchangers by Xueliang Li, Yaping Mao
Cover of the book Global Entrepreneurship and Development Index 2017 by Xueliang Li, Yaping Mao
Cover of the book Water Politics and Political Culture by Xueliang Li, Yaping Mao
Cover of the book Autoethnographies on the Environment and Human Health by Xueliang Li, Yaping Mao
Cover of the book Biofuels in Brazil by Xueliang Li, Yaping Mao
Cover of the book Distribution of Insurance-Based Investment Products by Xueliang Li, Yaping Mao
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy