Abstract:The edge C 4 graph of a graph G, E 4 (G) is a graph whose vertices are the edges of G and two vertices in E 4 (G) are adjacent if the corresponding edges in G are either incident or are opposite edges of some C 4. In this paper, we show that there exist infinitely many pairs of non isomorphic graphs whose edge C 4 graphs are isomorphic. We study the relationship between the diameter, radius and domination number of G and those of E 4 (G). It is shown that for any graph G without isolated vertices, there exists… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.