Abstract
As investigation of the concept of a line graph has led to many interesting results, it is natural to expect that there has also been meaningful research into variations and generalizations of the subject. In this, the first of several chapters on such topics, instead of just the edges of a given graph becoming the vertices of a new graph, both the vertices and the edges of the original become vertices. The new graph is called the total graph of the original, and of course adjacency in the total graph has an appropriate definition, combining incidence and adjacency from the original graph. It so happens that total graphs have a nice alternative description in terms first of replacing the edges of a graph by paths of length 2 and then joining by an edge any vertices at distance 2. After some elementary properties of total graphs results on planarity, Eulerian and Hamiltonian total graphs are analyzed. The chapter concludes with results on total digraphs, which behave quite differently from total 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, The connectivities of line and total graphs. J. Graph Theory 6, 197–203 (1982)
M. Behzad, Graphs and their chromatic numbers. Doctoral thesis, Michigan State University (1965)
M. Behzad, A criterion for the planarity of the total graph of a graph. Proc. Cambridge Philos. Soc. 63, 679–681 (1967)
M. Behzad, A characterization of total graphs. Proc. Amer. Math. Soc. 26, 383–389 (1970)
M. Behzad, H. Radjavi, The total group of a graph. Proc. Amer. Math. Soc. 19, 158–163 (1968)
M. Behzad, H. Radjavi, Structure of regular total graphs. J. London Math. Soc. 44, 433–436 (1969)
M. Behzad, G. Chartrand, E.A. Nordhaus, Triangles in line graphs and total graphs. Indian J. Math. 10, 109–120 (1968)
G. Chartrand, M.J. Stewart, Total digraphs. Canad. Math. Bull. 9, 171–176 (1966)
F. Gavril, A recognition algorithm for the total graphs. Networks 8, 121–133 (1978)
T. Hamada, T. Nonaka, I. Yoshimura, On the Connectivity of total graphs. Math. Ann. 196, 30–38 (1972)
F. Harary, R.M. Karp, W.T. Tutte, A criterion for planarity of the square of a graph. J. Combin. Theory 2, 395–405 (1967)
J. Liu, J. Meng, Super-arc-connected and super-connected total digraphs. Ars Combin. 87, 97–104 (2008)
J.M.S. Simões Pereira, Connectivity, line-connectivity and J-connection of the total graph. Math. Ann. 196, 48–57 (1972)
M. Skowrońska, M. Sysło, C. Zamfirescu, An algorithmic characterization of total digraphs. J. Algorithms 7, 120–133 (1986)
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). Total Graphs and Total Digraphs. In: Line Graphs and Line Digraphs. Developments in Mathematics, vol 68. Springer, Cham. https://doi.org/10.1007/978-3-030-81386-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-030-81386-4_13
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)