defined a graph M(G) as an intersection graph
O(F) on the vertex-set V(G) of any graph G. Let X(G) be the edge-set of G and
F = V'(G)O X(G) where V'(G) indicates the family of one-point subsets of the
set V(G). Let M(G)= O(F). M(G) is called the middle graph of G
The concept of middle graph was introduced by T.Hamada and
I.Yoshimura in 1974 [8].The middle graph of a graph G, denoted by M(G), is
the graph obtained from G by inserting a new vertex into every edge of G and
by joining those pairs of these new vertices with edges which lie on adjacent
edges of G.