Abstract
This chapter focuses on line graphs and how the parameters of the vertex-connectivity and the edge-connectivity are affected by a graph’s being a line graph. Most of the results provide equalities or inequalities involving some of the three classical parameters of the connectivity, the edge-connectivity, and the minimum degree of both graphs and line graphs. The last section applies some of these concepts to iterated line graphs.
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
References
D. Bauer, R. Tindell, Graphs with prescribed connectivity and line graph connectivity. J. Graph Theory 3, 393–395 (1979)
D. Bauer, R. Tindell, The connectivities of line and total graphs. J. Graph Theory 6, 197–203 (1982)
G. Chartrand, M.J. Stewart, The connectivity of line-graphs. Math. Ann. 182, 170–174 (1969)
M. Knor, L'. Niepel, Connectivity of iterated line graphs. Discret. Appl. Math. 125, 255–266 (2003)
L'. Niepel, M. Knor, L'. Šoltés, Distances in iterated line graphs. Ars Combin. 43, 193–202 (1996)
T. Zamfirescu, On the line-connectivity of line-graphs. Math. Ann. 187, 305–309 (1970)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this chapter
Cite this chapter
Beineke, L.W., Bagga, J.S. (2021). Connectivity of Line Graphs. In: Line Graphs and Line Digraphs. Developments in Mathematics, vol 68. Springer, Cham. https://doi.org/10.1007/978-3-030-81386-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-030-81386-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-81384-0
Online ISBN: 978-3-030-81386-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)