LEADER 03851nam  22006855  450 
001 9910254098903321
005 20251116155834.0
010   $a3-319-33828-5
024 7 $a10.1007/978-3-319-33828-6
035   $a(CKB)3710000000734712
035   $a(EBL)4573807
035   $a(DE-He213)978-3-319-33828-6
035   $a(MiAaPQ)EBC4573807
035   $a(PPN)194379930
035   $a(EXLCZ)993710000000734712
100   $a20160630d2016      u|         0
101 0 $aeng
135   $aur|n|---|||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aGeneralized connectivity of graphs /$fby Xueliang Li, Yaping Mao
205   $a1st ed. 2016.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2016.
215   $a1 online resource (148 p.)
225 1 $aSpringerBriefs in Mathematics,$x2191-8198
300   $aDescription based upon print version of record.
311 08$a3-319-33827-7 
320   $aIncludes bibliographical references and index.
327   $a1. 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. .
330   $aNoteworthy 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.
410  0$aSpringerBriefs in Mathematics,$x2191-8198
606   $aGraph theory
606   $aCombinatorial analysis
606   $aComputer science?Mathematics
606   $aOperations research
606   $aManagement science
606   $aGraph Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M29020
606   $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010
606   $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028
606   $aOperations Research, Management Science$3https://scigraph.springernature.com/ontologies/product-market-codes/M26024
615  0$aGraph theory.
615  0$aCombinatorial analysis.
615  0$aComputer science?Mathematics.
615  0$aOperations research.
615  0$aManagement science.
615 14$aGraph Theory.
615 24$aCombinatorics.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aOperations Research, Management Science.
676   $a510
700   $aLi$b Xueliang$4aut$4http://id.loc.gov/vocabulary/relators/aut$0755922
702   $aMao$b Yaping$4aut$4http://id.loc.gov/vocabulary/relators/aut
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910254098903321
996   $aGeneralized Connectivity of Graphs$92028737
997   $aUNINA