Abstract
As we have seen in the preceding chapters, the most basic property a graph possesses is that of being connected. A most basic concept to study connectedness of a connected graph is connectivity of the graph. The most sensitive parameters measuring the connectivity of a graph are (vertex-) connectivity and edge-connectivity of the graph. We will, in this chapter, discuss these two parameters in two its local and global aspects.
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
© 2003 Springer Science+Business Media New York
About this chapter
Cite this chapter
Xu, J. (2003). Flows and Connectivity. In: Theory and Application of Graphs. Network Theory and Applications, vol 10. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8698-6_4
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8698-6_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4670-8
Online ISBN: 978-1-4419-8698-6
eBook Packages: Springer Book Archive