Abstract
We introduce new methods of studying properties of iterated line graphs and demonstrate the use of these methods on a class of tree graphs. We also describe plans to generalize these methods further and derive identities for the number of vertices in the iterated line graphs of arbitrary graphs among other potential extensions of the methodology.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Balch, B.: Iterated line graphs on bi-regular graphs and trees. Rose-Hulman Undergrad. Math. J. 21(1) , Article 2 (2020)
King, Z.: Iterated line graphs of graphs with regular and bi-regular partitions. Unpublished.
Merris, R.: Graph Theory. Wiley (2001)
Wiener, N.W.: A Simplification of the Logic of Relations (1912)
Kathiresan, K.M.: A Study on H-line graphs. Australian J. Combin. 58(3), 358ā364 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
King, Z., Lane-Harvard, L., Milligan, T. (2024). Counting Vertices inĀ Iterated Line Graphs. In: Hoffman, F., Holliday, S., Rosen, Z., Shahrokhi, F., Wierman, J. (eds) Combinatorics, Graph Theory and Computing. SEICCGTC 2021. Springer Proceedings in Mathematics & Statistics, vol 448. Springer, Cham. https://doi.org/10.1007/978-3-031-52969-6_27
Download citation
DOI: https://doi.org/10.1007/978-3-031-52969-6_27
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-52968-9
Online ISBN: 978-3-031-52969-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)