31 July 2024 in SN Computer Science
18 June 2026 in Boletín de la Sociedad Matemática Mexicana
30 October 2024 in International Journal of Mathematics Trends and Technology
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.