Coverart for item
The Resource Generalized Connectivity of Graphs, by Xueliang Li, Yaping Mao, (electronic resource)

Generalized Connectivity of Graphs, by Xueliang Li, Yaping Mao, (electronic resource)

Label
Generalized Connectivity of Graphs
Title
Generalized Connectivity of Graphs
Statement of responsibility
by Xueliang Li, Yaping Mao
Creator
Contributor
Author
Subject
Language
eng
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.--
Member of
Assigning source
Provided by publisher
http://library.link/vocab/creatorName
Li, Xueliang
Dewey number
223
Image bit depth
0
Literary form
non fiction
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
Mao, Yaping
Series statement
  • SpringerBriefs in Mathematics,
  • Springer eBooks
http://library.link/vocab/subjectName
  • Mathematics
  • Computer science
  • Operations research
  • Management science
  • Combinatorics
  • Graph theory
Label
Generalized Connectivity of Graphs, by Xueliang Li, Yaping Mao, (electronic resource)
Link
http://ezproxy.eui.eu/login?url=http://dx.doi.org/10.1007/978-3-319-33828-6
Instantiates
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier.
Color
not applicable
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent.
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
Control code
978-3-319-33828-6
Dimensions
unknown
Extent
1 online resource (X, 143 pages)
File format
multiple file formats
Form of item
  • online
  • electronic
Governing access note
Use of this electronic resource may be governed by a license agreement which restricts use to the European University Institute community. Each user is responsible for limiting use to individual, non-commercial purposes, without systematically downloading, distributing, or retaining substantial portions of information, provided that all copyright and other proprietary notices contained on the materials are retained. The use of software, including scripts, agents, or robots, is generally prohibited and may result in the loss of access to these resources for the entire European University Institute community
Isbn
9783319338286
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia.
Media type code
  • c
Other control number
10.1007/978-3-319-33828-6
Other physical details
28 illustrations, 6 illustrations in color.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)952973292
Label
Generalized Connectivity of Graphs, by Xueliang Li, Yaping Mao, (electronic resource)
Link
http://ezproxy.eui.eu/login?url=http://dx.doi.org/10.1007/978-3-319-33828-6
Publication
Antecedent source
mixed
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier.
Color
not applicable
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent.
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
Control code
978-3-319-33828-6
Dimensions
unknown
Extent
1 online resource (X, 143 pages)
File format
multiple file formats
Form of item
  • online
  • electronic
Governing access note
Use of this electronic resource may be governed by a license agreement which restricts use to the European University Institute community. Each user is responsible for limiting use to individual, non-commercial purposes, without systematically downloading, distributing, or retaining substantial portions of information, provided that all copyright and other proprietary notices contained on the materials are retained. The use of software, including scripts, agents, or robots, is generally prohibited and may result in the loss of access to these resources for the entire European University Institute community
Isbn
9783319338286
Level of compression
uncompressed
Media category
computer
Media MARC source
rdamedia.
Media type code
  • c
Other control number
10.1007/978-3-319-33828-6
Other physical details
28 illustrations, 6 illustrations in color.
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
(OCoLC)952973292

Library Locations

    • Badia FiesolanaBorrow it
      Via dei Roccettini 9, San Domenico di Fiesole, 50014, IT
      43.803074 11.283055
Processing Feedback ...