On the Clique-Edge Graph of a Graph

Manjunath A S; Sudin S; Sunil Kumar P R

doi:https://doi.org/10.14445/22315373/IJMTT-V70I10P101

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 70 | Issue 10 | Year 2024 | Article Id. IJMTT-V70I10P101 | DOI : https://doi.org/10.14445/22315373/IJMTT-V70I10P101

On the Clique-Edge Graph of a Graph

Manjunath A S, Sudin S, Sunil Kumar P R

Received	Revised	Accepted	Published
07 Aug 2024	16 Sep 2024	05 Oct 2024	22 Oct 2024

Abstract

In this paper, we analyse the concept of the clique-edge graph, CE(G), which is defined as the edge intersection graph of all cliques within a given graph G. We discuss the impact of various binary operations on the structure and properties of the clique-edge graph, providing a detailed analysis of how these operations influence CE(G). Additionally, we investigate the connectedness of CE(G), offering insights into the conditions under which the clique-edge graph remains connected or becomes disconnected.

Keywords

Clique-Edge Graphs, Composition, Connectedness, Join, Triangle graph.

References

[1] R. Balakrishnan, “Triangle Graphs,” Graph Connections (Cochin, 1998), Allied Publication, pp. 1-44, 1999.
[Google Scholar]
[2] Y. Egawa, R. E. Ramos, “Triangle Graphs,” Maths Japon, vol. 36, pp. 465-467, 1991.
[Google Scholar]
[3] Ronald C. Hamelink, “A Partial Characterization of Clique Graphs,” Journal of Combinatorial Theory, vol. 5, pp. 192-197, 1968.
[CrossRef] [Google Scholar] [Publisher Link]
[4] Claudson F. Bornstein, and Jayme L. Szwarcfiter, “On Clique Convergence of Graphs,” AKCE International Journal of Graphs and Combinatorics, vol. 13, no. 3, pp. 261-266, 2016.
[CrossRef] [Google Scholar] [Publisher Link]
[5] Severino V. Gervacio, “Cycle Graphs,” Graph Theory Singapore 1983, pp. 279-293, 1983.
[CrossRef] [Google Scholar] [Publisher Link]
[6] József Krausz, “New Demonstration of a Whitney Theorem on Lattices (Hungarian with French Summary),” Mat. Fiz Lapok, vol. 50, no. 1, pp. 75-85, 1943.
[Google Scholar]
[7] E. Prisner, “Graph Dynamics,” Longman, 1995.
[Google Scholar]
[8] Norman J. Pullman, “Clique Covering of Graphs IV. Algorithms,” SIAM Journal on Computing, vol. 13, pp. 57-75, 1984.
[CrossRef] [Google Scholar] [Publisher Link]
[9] E.L. Tan, “Classification of Graphs According to their Cycle Graphs,” Mathematical Methods Proceedings, Chiang Mai University, Thailand, 1988.
[Google Scholar]
[10] E.L. Tan, “Some Classes of Cycle Graphs,” Research Report 238, National University of Singapore, 1986.
[Google Scholar]
[11] Douglas Brent West, “Introduction to Graph Theory,” Pearson Education India, 2001.
[Google Scholar]
[12] Zs. Tuza, “Some Open Problems on Colorings and Coverings of Graphs (Abstract),” Graphentheorie-Tagung Oberwolfach, pp. 15-16, 1990.
[Google Scholar]

Citation :

Manjunath A S, Sudin S, Sunil Kumar P R, "On the Clique-Edge Graph of a Graph," International Journal of Mathematics Trends and Technology (IJMTT), vol. 70, no. 10, pp. 1-6, 2024. Crossref, https://doi.org/10.14445/22315373/IJMTT-V70I10P101