Generalized Connectivity of Graphs

Authors: Li, Xueliang, Mao, Yaping

Free Preview

Brings together results, conjectures, and open problems on generalized connectivity
Features theoretical and practical analysis for generalized (edge-) connectivity
Contains essential proofs

see more benefits

Buy this book

eBook 44,02 €

price for Spain (gross)

Buy eBook

ISBN 978-3-319-33828-6
Digitally watermarked, DRM-free
Included format: EPUB, PDF
ebooks can be used on all reading devices
Immediate eBook download after purchase

Softcover 57,19 €

price for Spain (gross)

Buy Softcover

ISBN 978-3-319-33827-9
Free shipping for individuals worldwide
Usually dispatched within 3 to 5 business days.
The final prices may differ from the prices shown due to specifics of VAT rules

About this book: 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.

Show all
Reviews: “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 background in the relevant fields, as most concepts are introduced and defined … . I would recommend it for a researcher, graduate student, or senior undergraduate student who has an interest in pursuing research on this subject.” (Joy M. W. Morris, Mathematical Reviews, April, 2017)

“This book is a concise and elegant piece of work on an old yet new topic of combinatorics. … The book may be of interest for those who work with communication networks, graph theory and combinatorial optimizations in general.” (Yilun Shang, zbMATH 1346.05001, 2016)

Show all

Table of contents (9 chapters)

Introduction

Li, Xueliang (et al.)

Pages 1-13

Preview Buy Chapter 30,19 €
Results for Some Graph Classes

Li, Xueliang (et al.)

Pages 15-29

Preview Buy Chapter 30,19 €
Algorithm and Complexity

Li, Xueliang (et al.)

Pages 31-39

Preview Buy Chapter 30,19 €
Sharp Bounds of the Generalized (Edge-)Connectivity

Li, Xueliang (et al.)

Pages 41-57

Preview Buy Chapter 30,19 €
Graphs with Given Generalized Connectivity

Li, Xueliang (et al.)

Pages 59-66

Preview Buy Chapter 30,19 €