Abstract
For a graph G, the total graph T(G) of G is the graph with vertex set V(G) ∪ E(G) in which the vertices x and y are joined by an edge if x and y are adjacent or incident in G. In this paper, we show that the complement of total graph T(G) of a simple graph G is hamiltonian if and only if G is not isomorphic to any graph in {K 1, r | r ≥ 1} ∪ {K 1, s + K 1| s ≥ 1} ∪ {K 1, t + e| t ≥ 2} ∪ {K 2 + 2K 1, K 3 + ,K 1, K 3 + 2K 1, K 4}.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Bondy, J.A., Chvátal, V.: A Method in Graph Theory. Discrete Math. 15, 111–135 (1976)
Bondy, J.A., Murty, U.S.R: Graph Theory with Applications. American Elsevier, New York (1976)
Chartrand, G., Hevia, H., Jarrett, E.B., Schultz, M.: Subgraph Distances in Graphs Defined by Edge Transfers. Discrete Math. 170, 63–79 (1997)
Chvátal, V., Erdös, P.: A Note on Hamiltonian Circuits. Discrete Math. 2, 111–113 (1972)
Fleischner, H., Hobbs, A.M.: Hamiltonian Total Graphs. Math. Notes 68, 59–82 (1975)
Harary, F.: Graph Theory. Addison-Wesley, London, UK (1971)
Harary, F., Nash-Williams, C.St.J.A.: On Eulerian and Hamiltonian Graphs and Line Graphs. Canad. Math. Bull. 8, 701–709 (1965)
Wu, B., Meng, J.: Basic Properties of Total Transformation Graphs. J. Math. Study 34(2), 109–116 (2001)
Wu, B., Meng, J.: Hamiltonian Jump Graphs. Discrete Math. 289, 95–106 (2004)
Wu, B., Zhang, L., Zhang, Z.: The Transformation Graph G xyz when xyz = − + +. Discrete Math. 296, 263–270 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Ma, G., Wu, B. (2007). Hamiltonicity of Complements of Total Graphs. In: Akiyama, J., Chen, W.Y.C., Kano, M., Li, X., Yu, Q. (eds) Discrete Geometry, Combinatorics and Graph Theory. CJCDGCGT 2005. Lecture Notes in Computer Science, vol 4381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70666-3_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-70666-3_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70665-6
Online ISBN: 978-3-540-70666-3
eBook Packages: Computer ScienceComputer Science (R0)