skip to content
Generalized connectivity of graphs Preview this item
ClosePreview this item
Checking...

Generalized connectivity of graphs

Author: X Li; Yaping Mao
Publisher: Switzerland : Springer, 2016.
Series: SpringerBriefs in mathematics.
Edition/Format:   eBook : Document : EnglishView all editions and formats
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Additional Physical Format: Print version:
(OCoLC)945949410
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: X Li; Yaping Mao
ISBN: 9783319338286 3319338285
OCLC Number: 952973292
Description: 1 online resource (x, 143 pages) : illustrations (some color).
Contents: 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. .
Series Title: SpringerBriefs in mathematics.
Responsibility: Xueliang Li, Yaping Mao.

Abstract:

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.

Reviews

Editorial reviews

Publisher Synopsis

"The monograph under review is devoted to the exposition of results about the generalized connectivity and generalized edge-connectivity of graphs. ... Reading it does not require significant Read more...

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/952973292> # Generalized connectivity of graphs
    a schema:MediaObject, schema:Book, schema:CreativeWork ;
    library:oclcnum "952973292" ;
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/sz> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/3331147349#Topic/graph_connectivity> ; # Graph connectivity
    schema:about <http://experiment.worldcat.org/entity/work/data/3331147349#Topic/graph_theory> ; # Graph theory
    schema:about <http://dewey.info/class/511.5/e23/> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/3331147349#Topic/combinatorial_analysis> ; # Combinatorial analysis
    schema:about <http://experiment.worldcat.org/entity/work/data/3331147349#Topic/computer_science_mathematics> ; # Computer science--Mathematics
    schema:about <http://experiment.worldcat.org/entity/work/data/3331147349#Topic/mathematics_general> ; # MATHEMATICS / General
    schema:author <http://experiment.worldcat.org/entity/work/data/3331147349#Person/li_x_xueliang_1958> ; # Xueliang Li
    schema:author <http://experiment.worldcat.org/entity/work/data/3331147349#Person/mao_yaping> ; # Yaping Mao
    schema:bookFormat schema:EBook ;
    schema:datePublished "2016" ;
    schema:description "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."@en ;
    schema:description "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. ."@en ;
    schema:exampleOfWork <http://worldcat.org/entity/work/id/3331147349> ;
    schema:genre "Electronic books"@en ;
    schema:inLanguage "en" ;
    schema:isPartOf <http://worldcat.org/issn/2191-8198> ; # SpringerBriefs in mathematics,
    schema:isPartOf <http://experiment.worldcat.org/entity/work/data/3331147349#Series/springerbriefs_in_mathematics> ; # SpringerBriefs in mathematics.
    schema:isSimilarTo <http://www.worldcat.org/oclc/945949410> ;
    schema:name "Generalized connectivity of graphs"@en ;
    schema:productID "952973292" ;
    schema:url <https://0-link-springer-com.pugwash.lib.warwick.ac.uk/book/10.1007/978-3-319-33828-6> ;
    schema:url <http://proxy.artic.edu/login?url=http://link.springer.com/10.1007/978-3-319-33828-6> ;
    schema:url <http://lib.myilibrary.com/detail.asp?id=937447> ;
    schema:url <http://er.llcc.edu:2048/login?url=http://link.springer.com/10.1007/978-3-319-33828-6> ;
    schema:url <http://proxy.ohiolink.edu:9099/login?url=http://link.springer.com/10.1007/978-3-319-33828-6> ;
    schema:url <https://login.proxy.lib.strath.ac.uk/login?url=http://link.springer.com/10.1007/978-3-319-33828-6> ;
    schema:url <https://grinnell.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-33828-6> ;
    schema:url <http://sfx.carli.illinois.edu/sfxwhe/sfx_local?genre=book&sid=Voyager:WHE&sfx.ignore_date_threshold=1&svc.fulltext=yes&rft.isbn=978-3-319-33828-6> ;
    schema:url <http://ezproxy.eui.eu/login?url=http://dx.doi.org/10.1007/978-3-319-33828-6> ;
    schema:url <http://link.springer.com/10.1007/978-3-319-33828-6> ;
    schema:url <http://lib.myilibrary.com?id=937447> ;
    schema:url <http://rave.ohiolink.edu/ebooks/ebc/9783319338286> ;
    schema:url <https://login.libproxy.uregina.ca:8443/login?url=http://link.springer.com/openurl?genre=book&isbn=978-3-319-33827-9> ;
    schema:url <https://proxy1.library.eiu.edu/login?url=http://link.springer.com/10.1007/978-3-319-33828-6> ;
    schema:url <http://dx.doi.org/10.1007/978-3-319-33828-6> ;
    schema:url <http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=1218843> ;
    schema:url <https://login.libproxy.uregina.ca:8443/login?url=https://link.springer.com/openurl?genre=book&isbn=978-3-319-33827-9> ;
    schema:url <http://libproxy.uwinnipeg.ca/login?url=http://link.springer.com/10.1007/978-3-319-33828-6> ;
    schema:url <http://link.springer.com/openurl?genre=book&isbn=978-3-319-33827-9> ;
    schema:url <https://login.libproxy.noctrl.edu/login?url=http://link.springer.com/10.1007/978-3-319-33828-6> ;
    schema:workExample <http://dx.doi.org/10.1007/978-3-319-33828-6> ;
    schema:workExample <http://worldcat.org/isbn/9783319338286> ;
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/952973292> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/3331147349#Person/li_x_xueliang_1958> # Xueliang Li
    a schema:Person ;
    schema:birthDate "1958" ;
    schema:familyName "Li" ;
    schema:givenName "Xueliang" ;
    schema:givenName "X." ;
    schema:name "Xueliang Li" ;
    .

<http://experiment.worldcat.org/entity/work/data/3331147349#Person/mao_yaping> # Yaping Mao
    a schema:Person ;
    schema:familyName "Mao" ;
    schema:givenName "Yaping" ;
    schema:name "Yaping Mao" ;
    .

<http://experiment.worldcat.org/entity/work/data/3331147349#Series/springerbriefs_in_mathematics> # SpringerBriefs in mathematics.
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/952973292> ; # Generalized connectivity of graphs
    schema:name "SpringerBriefs in mathematics." ;
    .

<http://experiment.worldcat.org/entity/work/data/3331147349#Topic/combinatorial_analysis> # Combinatorial analysis
    a schema:Intangible ;
    schema:name "Combinatorial analysis"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/3331147349#Topic/computer_science_mathematics> # Computer science--Mathematics
    a schema:Intangible ;
    schema:name "Computer science--Mathematics"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/3331147349#Topic/graph_connectivity> # Graph connectivity
    a schema:Intangible ;
    schema:name "Graph connectivity"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/3331147349#Topic/mathematics_general> # MATHEMATICS / General
    a schema:Intangible ;
    schema:name "MATHEMATICS / General"@en ;
    .

<http://lib.myilibrary.com?id=937447>
    rdfs:comment "Connect to MyiLibrary resource." ;
    .

<http://link.springer.com/10.1007/978-3-319-33828-6>
    rdfs:comment "Connect to resource" ;
    .

<http://link.springer.com/openurl?genre=book&isbn=978-3-319-33827-9>
    rdfs:comment "Springer eBooks (Mathematics and Statistics 2016)" ;
    .

<http://rave.ohiolink.edu/ebooks/ebc/9783319338286>
    rdfs:comment "Connect to resource" ;
    .

<http://worldcat.org/isbn/9783319338286>
    a schema:ProductModel ;
    schema:isbn "3319338285" ;
    schema:isbn "9783319338286" ;
    .

<http://worldcat.org/issn/2191-8198> # SpringerBriefs in mathematics,
    a bgn:PublicationSeries ;
    schema:hasPart <http://www.worldcat.org/oclc/952973292> ; # Generalized connectivity of graphs
    schema:issn "2191-8198" ;
    schema:name "SpringerBriefs in mathematics," ;
    .

<http://www.worldcat.org/oclc/945949410>
    a schema:CreativeWork ;
    schema:description "Print version:" ;
    schema:isSimilarTo <http://www.worldcat.org/oclc/952973292> ; # Generalized connectivity of graphs
    .

<https://login.libproxy.uregina.ca:8443/login?url=http://link.springer.com/openurl?genre=book&isbn=978-3-319-33827-9>
    rdfs:comment "Full text available from SpringerLINK ebooks - Mathematics and Statistics (2016)" ;
    .

<https://login.libproxy.uregina.ca:8443/login?url=https://link.springer.com/openurl?genre=book&isbn=978-3-319-33827-9>
    rdfs:comment "Full text available from SpringerLINK ebooks - Mathematics and Statistics (2016)" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.