Generalized connectivity of graphs /

Saved in:
Bibliographic Details
Author / Creator:Li, X. (Xueliang), 1958- author.
Imprint:Switzerland : Springer, 2016.
Description:1 online resource (x, 143 pages) : illustrations (some color)
Language:English
Series:SpringerBriefs in mathematics, 2191-8198
SpringerBriefs in mathematics.
Subject:
Format: E-Resource Book
URL for this record:http://pi.lib.uchicago.edu/1001/cat/bib/11264164
Hidden Bibliographic Details
Other authors / contributors:Mao, Yaping, author.
ISBN:9783319338286
3319338285
9783319338279
3319338277
Notes:Includes bibliographical references and index.
Online resource; title from PDF title page (SpringerLink, viewed July 12, 2016).
Summary: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.
Other form:Print version: 9783319338279 3319338277
Standard no.:10.1007/978-3-319-33828-6

MARC

LEADER 00000cam a2200000Ii 4500
001 11264164
005 20210625184620.3
006 m o d
007 cr |n|||||||||
008 160704s2016 sz a ob 001 0 eng d
015 |a GBB8K7229  |2 bnb 
016 7 |a 019109790  |2 Uk 
019 |a 1197540668 
020 |a 9783319338286  |q (electronic bk.) 
020 |a 3319338285  |q (electronic bk.) 
020 |z 9783319338279  |q (print) 
020 |z 3319338277  |q (print) 
024 7 |a 10.1007/978-3-319-33828-6  |2 doi 
035 |a (OCoLC)952973292  |z (OCoLC)1197540668 
035 9 |a (OCLCCM-CC)952973292 
037 |a com.springer.onix.9783319338286  |b Springer Nature 
040 |a YDXCP  |b eng  |e rda  |e pn  |c YDXCP  |d N$T  |d AZU  |d IDEBK  |d OCLCO  |d GW5XE  |d N$T  |d OCLCF  |d COO  |d DEBSZ  |d JG0  |d UAB  |d IAD  |d JBG  |d ICW  |d Z5A  |d ILO  |d ICN  |d FIE  |d OCLCQ  |d ESU  |d IOG  |d U3W  |d REB  |d OCLCQ  |d KSU  |d WYU  |d UKMGB  |d OCLCQ  |d UKAHL  |d AJS  |d SFB 
049 |a MAIN 
050 4 |a QA166.243 
072 7 |a MAT  |x 000000  |2 bisacsh 
072 7 |a PBV  |2 bicssc 
100 1 |a Li, X.  |q (Xueliang),  |d 1958-  |e author.  |0 http://id.loc.gov/authorities/names/nb2010004029 
245 1 0 |a Generalized connectivity of graphs /  |c Xueliang Li, Yaping Mao. 
264 1 |a Switzerland :  |b Springer,  |c 2016. 
300 |a 1 online resource (x, 143 pages) :  |b illustrations (some color) 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
490 1 |a SpringerBriefs in mathematics,  |x 2191-8198 
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. 
504 |a Includes bibliographical references and 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. 
588 0 |a Online resource; title from PDF title page (SpringerLink, viewed July 12, 2016). 
650 0 |a Graph connectivity.  |0 http://id.loc.gov/authorities/subjects/sh2008001302 
650 0 |a Computer science  |x Mathematics.  |0 http://id.loc.gov/authorities/subjects/sh85042295 
650 0 |a Combinatorial analysis.  |0 http://id.loc.gov/authorities/subjects/sh85028802 
650 0 |a Graph theory.  |0 http://id.loc.gov/authorities/subjects/sh85056471 
650 7 |a Combinatorics & graph theory.  |2 bicssc 
650 7 |a Discrete mathematics.  |2 bicssc 
650 7 |a Operational research.  |2 bicssc 
650 7 |a MATHEMATICS  |x General.  |2 bisacsh 
650 7 |a Combinatorial analysis.  |2 fast  |0 (OCoLC)fst00868961 
650 7 |a Computer science  |x Mathematics.  |2 fast  |0 (OCoLC)fst00872460 
650 7 |a Graph connectivity.  |2 fast  |0 (OCoLC)fst01745205 
650 7 |a Graph theory.  |2 fast  |0 (OCoLC)fst00946584 
655 0 |a Electronic books. 
655 4 |a Electronic books. 
700 1 |a Mao, Yaping,  |e author. 
776 0 8 |i Print version:  |z 9783319338279  |z 3319338277  |w (OCoLC)945949410 
830 0 |a SpringerBriefs in mathematics.  |0 http://id.loc.gov/authorities/names/no2011133396 
903 |a HeVa 
929 |a oclccm 
999 f f |i 5d088723-a7af-5bfe-b484-de5d0d0ded9e  |s 1710a1c2-0278-5389-941e-daef5fde6d05 
928 |t Library of Congress classification  |a QA166.243  |l Online  |c UC-FullText  |u https://link.springer.com/10.1007/978-3-319-33828-6  |z Springer Nature  |g ebooks  |i 12538394