Generalized connectivity of graphs
Resource Information
The work Generalized connectivity of graphs represents a distinct intellectual or artistic creation found in University of Liverpool. This resource is a combination of several types including: Work, Language Material, Books.
The Resource
Generalized connectivity of graphs
Resource Information
The work Generalized connectivity of graphs represents a distinct intellectual or artistic creation found in University of Liverpool. This resource is a combination of several types including: Work, Language Material, Books.
- Label
- Generalized connectivity of graphs
- Statement of responsibility
- Xueliang Li, Yaping Mao
- 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
- Cataloging source
- YDXCP
- Dewey number
- 511/.5
- Illustrations
- illustrations
- Index
- index present
- LC call number
- QA166.243
- Literary form
- non fiction
- Nature of contents
-
- dictionaries
- bibliography
- Series statement
- SpringerBriefs in mathematics,
Context
Context of Generalized connectivity of graphsWork of
No resources found
No enriched resources found
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.liverpool.ac.uk/resource/B8bCMU4ZiOQ/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/resource/B8bCMU4ZiOQ/">Generalized connectivity of graphs</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Work Generalized connectivity of graphs
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.liverpool.ac.uk/resource/B8bCMU4ZiOQ/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.liverpool.ac.uk/resource/B8bCMU4ZiOQ/">Generalized connectivity of graphs</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.liverpool.ac.uk/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.liverpool.ac.uk/">University of Liverpool</a></span></span></span></span></div>
