Abstract
The line graph of a graph G denoted as L(G) has vertex set E(G) in which two vertices are adjacent if they correspond to adjacent edges in G. The lict graph and litact graph of G, denoted as \(L_c(G)\) and \(L_{ct}(G)\), respectively having vertex set \(E(G)\cup C(G)\) (here C(G) is the set of cut-vertices of G), two of these vertices will be adjacent in \(L_c(G)\) if they correspond to adjacent edges of G or one vertex is an edge e of G and other vertex is a cut-vertex c of G such that e is incident to c; and two vertices in \(L_{ct}(G)\) be adjacent if they are adjacent or incident elements of G. In this paper, we establish results on cliques and clique chromatic numbers in line, lict and litact graphs of any graph.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
M. Acharya, R. Jain, S. Kansal, Characterization of line-cut graphs. Graph Theory Notes of New York, LXV, vol. I (2014), pp. 43–46
F. Harary, Graph Theory (Addison-Wesley Publ. Comp, Massachusetts, Reading, 1969)
V.R. Kulli, M.H. Muddebihal, The lict graph and litact graph of a graph. J. Anal. Comput. 2(1), 33–43 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Jain, R., Jain, A.K. (2020). On Cliques and Clique Chromatic Numbers in Line, Lict and Lictact Graphs. In: Deo, N., Gupta, V., Acu, A., Agrawal, P. (eds) Mathematical Analysis II: Optimisation, Differential Equations and Graph Theory. ICRAPAM 2018. Springer Proceedings in Mathematics & Statistics, vol 307. Springer, Singapore. https://doi.org/10.1007/978-981-15-1157-8_12
Download citation
DOI: https://doi.org/10.1007/978-981-15-1157-8_12
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-1156-1
Online ISBN: 978-981-15-1157-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)