Cargando…

Generalized Connectivity of Graphs

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-) connectivi...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Li, Xueliang (Autor), Mao, Yaping (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cham : Springer International Publishing : Imprint: Springer, 2016.
Edición:1st ed. 2016.
Colección:SpringerBriefs in Mathematics,
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-319-33828-6
003 DE-He213
005 20220118211534.0
007 cr nn 008mamaa
008 160630s2016 sz | s |||| 0|eng d
020 |a 9783319338286  |9 978-3-319-33828-6 
024 7 |a 10.1007/978-3-319-33828-6  |2 doi 
050 4 |a QA166-166.247 
072 7 |a PBV  |2 bicssc 
072 7 |a MAT013000  |2 bisacsh 
072 7 |a PBV  |2 thema 
082 0 4 |a 511.5  |2 23 
100 1 |a Li, Xueliang.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 0 |a Generalized Connectivity of Graphs  |h [electronic resource] /  |c by Xueliang Li, Yaping Mao. 
250 |a 1st ed. 2016. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2016. 
300 |a X, 143 p. 28 illus., 6 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a SpringerBriefs in Mathematics,  |x 2191-8201 
505 0 |a 1. Introduction -- 2. Results for some graph classes -- 3. Algorithm and complexity -- 4. Sharp bounds of the generalized (edge-) connectivity -- 5. Graphs with given generalized connectivity -- 6. Nordhaus-Gaddum-type results -- 7. Results for graph products -- 8. Maximum generalized local connectivity -- 9. Generalized connectivity for random graphs -- Bibliography.- Index. . 
520 |a 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. 
650 0 |a Graph theory. 
650 0 |a Discrete mathematics. 
650 0 |a Computer science-Mathematics. 
650 0 |a Operations research. 
650 0 |a Management science. 
650 1 4 |a Graph Theory. 
650 2 4 |a Discrete Mathematics. 
650 2 4 |a Discrete Mathematics in Computer Science. 
650 2 4 |a Operations Research, Management Science . 
700 1 |a Mao, Yaping.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783319338279 
776 0 8 |i Printed edition:  |z 9783319338293 
830 0 |a SpringerBriefs in Mathematics,  |x 2191-8201 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-319-33828-6  |z Texto Completo 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713)