Generalized Connectivity of Graphs
Springer | Mathematics | August 2016 | ISBN-10: 3319338277 | 130 pages | pdf | 2.53 mb
Authors: Li, Xueliang, Mao, Yaping
Brings together results, conjectures, and open problems on generalized connectivity
Features theoretical and practical analysis for generalized (edge-) connectivity
Contains essential proofs
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.
Number of Illustrations and Tables
22 b/w illustrations, 6 illustrations in colour
Discrete Mathematics in Computer Science
Operations Research, Mathematical Programming
(Buy premium account for maximum speed and resumming ability)
бесплатно, без смс, регистрации, на халяву, через торрент, рекомендуем прочитать отзывыо Generalized Connectivity of Graphs.