Abstract
The connectivity of a graph is a “measure” of its connectedness. Some connected graphs are connected rather “loosely” in the sense that the deletion of a vertex or an edge from the graph destroys the connectedness of the graph. There are graphs in the other extreme as well, such as the complete graphs K n , n ≥ 2, which remain connected even after removal of all but one vertex.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Balakrishnan, R., Ranganathan, K. (2000). Connectivity. In: A Textbook of Graph Theory. Universitext. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8505-7_3
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8505-7_3
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4612-6422-4
Online ISBN: 978-1-4419-8505-7
eBook Packages: Springer Book Archive