Abstract
It is well known that in a graph, κ(G)≤λ(G) ≤ δ(G), where κ (G), δ(G) and d(G) denote the vertex connectivity, edge connectivity and the minimum degree of G, respectively. We show that in chordal graphs, if (G) ≠ d(G), then (G) = 2?(G) - 1. In contrast, in a general graph (G) can be equal to (G).
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.
References
G. Chartrand, F. Harary, Graphs with prescribed connectivities Theory of Graphs (P. Erdos and G. Katona, eds.) Akademiai Kiado, Budapest, 1968, 61–63.
F. Harary, Graph Theory. Addison-Wesley Reading, MA, 1969.
M.C. Golumbic, Algorithmic Graph Theory And Perfect Graphs. Academic Press, New York, 1980.
R.H. Mohring, Graph Problems Related To Gate Matrix Layout And PLA Folding. Computational Graph Theory, Pages 17–52, Springer, Wein, New York, 1990.
M. Yannakakis, Computing The Minimum Fill-in Is NP-Complete SIAM J. on Alge. Discre. Math. 2 77–79, 1981.
H. Whitney, Congruent Graphs and the connectivity of graphs. American J. Math, 54, 1932, 150–168
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chandran, L.S. (2001). Edge Connectivity vs Vertex Connectivity in Chordal Graphs. In: Wang, J. (eds) Computing and Combinatorics. COCOON 2001. Lecture Notes in Computer Science, vol 2108. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44679-6_42
Download citation
DOI: https://doi.org/10.1007/3-540-44679-6_42
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42494-9
Online ISBN: 978-3-540-44679-8
eBook Packages: Springer Book Archive