The edge C 4 graph of some graph classes
Manju K. Menon, Ambat Vijayakumar · Discussiones Mathematicae Graph Theory · 2010
The edge C4 graph of a graph G, E4(G) is a graph whose vertices are the edges of G and two vertices in E4(G) are adjacent if the corresponding edges in G are either incident or are opposite edges of some C4. In this paper, we show that there exist infinitely many pairs of non isomorphic graphs whose edge C4 graphs are isomorphic. We study the relationship between the diameter, radius and domination number of G and those of E4(G). It is shown that for any graph G without isolated vertices, there exists a super graph H such that C(H) = G and C(E4(H)) = E4(G). Also we give forbidden subgraph characterizations for E4(G) being a threshold graph, block graph, geodetic graph and weakly geodetic graph.