The middle graph M(G) of a graph G is the graph whose point set is the union of the set of points and lines of G with
two points adjacent if they are adjacent lines of G or one corresponds to a point and the other to a line incident with it.
This concept was introduced in [3] and was studied by Kulli and Patil in [27, 28, 29].
We define a graph M(G) as an intersection graph @W(F) on the point set V(G) of any graph G. Let X(G) be the line set of G and F = V'(G) @? X(G), where V'(G) indicates the family of all one point subsets of the set V(G). Let M(G) = @W(F). M(G) is called the middle graph of G.