Let G(V,E) be a simple connected graph, with β£Eβ£=Ο΅. In this
paper, we define an edge-set graph GGβ constructed from the graph
G such that any vertex vs,iβ of GGβ corresponds to the i-th
s-element subset of E(G) and any two vertices vs,iβ,vk,mβ of
GGβ are adjacent if and only if there is at least one edge in the
edge-subset corresponding to vs,iβ which is adjacent to at least one edge
in the edge-subset corresponding to vk,mβ where s,k are positive
integers. It can be noted that the edge-set graph GGβ of a graph G
id dependent on both the structure of G as well as the number of edges
Ο΅. We also discuss the characteristics and properties of the edge-set
graphs corresponding to certain standard graphs.Comment: 10 pages, 2 figure