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 Euro-Par 2016: Parallel Processing Workshops by Xueliang Li, Yaping Mao
Cover of the book Teaching and Learning in Maths Classrooms by Xueliang Li, Yaping Mao
Cover of the book Pattern Recognition by Xueliang Li, Yaping Mao
Cover of the book New Perspectives on Approximation and Sampling Theory by Xueliang Li, Yaping Mao
Cover of the book Chinese Banking Reform by Xueliang Li, Yaping Mao
Cover of the book Magnetically Activated and Guided Isotope Separation by Xueliang Li, Yaping Mao
Cover of the book Deep Learning in Medical Image Analysis and Multimodal Learning for Clinical Decision Support by Xueliang Li, Yaping Mao
Cover of the book Advances in Transplant Dermatology by Xueliang Li, Yaping Mao
Cover of the book Digital Signal Processing for Wireless Communication using Matlab by Xueliang Li, Yaping Mao
Cover of the book Emotions in Second Language Teaching by Xueliang Li, Yaping Mao
Cover of the book The Chemical Bond I by Xueliang Li, Yaping Mao
Cover of the book Finite Elements Methods in Mechanics by Xueliang Li, Yaping Mao
Cover of the book Entrepreneurship, Innovation and Economic Crisis by Xueliang Li, Yaping Mao
Cover of the book Geoheritage of Volcanic Harrats in Saudi Arabia by Xueliang Li, Yaping Mao
Cover of the book Australian Screen in the 2000s 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