A characterization of the Total Graph of Interval Graphs and Proper Interval Graphs
DOI:
https://doi.org/10.12723/mjs.70.7Keywords:
Asteroidal triple, Interval graph, Proper interval graphs, Total graph, Triangular graphAbstract
An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighbourhood of the third vertex. Let G be a graph with vertex set V (G) and edge set E(G), the total graph T(G) of G has vertex set V (G)∪E(G) and two vertices in T(G) are adjacent if and only if they are adjacent or incident in G. In this paper, we try to characterize the total graph of interval graphs and proper interval graphs.
References
T. B. Athul and G. Suresh Singh, Total Graph of Regular Graphs, Advances in Mathematics: Scientific Journal 9, no.6, 2020, https://doi.org/10.37418/amsj.9.6.103.
M. Behzad, Graphs and and their chromatic numbers, PhD thesis, Michigan State University, 1965.
M. Behzad, Characterization of Total Graphs, Proceedings of American Mathematical Society, 1970, 383-389.
M. Behzad and H. Radjavi, Structure of Regular Total Graphs, Journal of London Mathematical Society, 1969, 433-436.
C. Lekkerkerker and D. Boland, Representation of finite graphs by a set of intervals on the real line, Fund. Math. 51, 1962, 45-64.
Zygmunt Jackowski, A new characterization interval graphs, Discrete Mathematics, North-Holland, 1992, 103-109.
Suresh Singh G, Graph Theory, PHI Learning Private Limited, 2010.
Additional Files
Published
Issue
Section
License
Copyright (c) 2024 Athul T B, Dr. G Suresh Singh
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
