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 Hesitant Fuzzy Methods for Multiple Criteria Decision Analysis by Xueliang Li, Yaping Mao
Cover of the book Conceptual Modeling by Xueliang Li, Yaping Mao
Cover of the book Climate Time Series Analysis by Xueliang Li, Yaping Mao
Cover of the book Algebra by Xueliang Li, Yaping Mao
Cover of the book Intelligent Techniques in Signal Processing for Multimedia Security by Xueliang Li, Yaping Mao
Cover of the book Militarized Cultural Encounters in the Long Nineteenth Century by Xueliang Li, Yaping Mao
Cover of the book Posing and Solving Mathematical Problems by Xueliang Li, Yaping Mao
Cover of the book Sustainability in Manufacturing Enterprises by Xueliang Li, Yaping Mao
Cover of the book Corpus-Based Studies on Non-Finite Complements in Recent English by Xueliang Li, Yaping Mao
Cover of the book Exercise in Space by Xueliang Li, Yaping Mao
Cover of the book Cyclostationarity: Theory and Methods – IV by Xueliang Li, Yaping Mao
Cover of the book African and Afro-Caribbean Repatriation, 1919–1922 by Xueliang Li, Yaping Mao
Cover of the book Affirmative Action Policies and Judicial Review Worldwide by Xueliang Li, Yaping Mao
Cover of the book Empirical Philosophy of Science by Xueliang Li, Yaping Mao
Cover of the book Electro-Chemo-Mechanics of Solids 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