The middle graph M(G) of a graph G is an intersection graph on the vertex set V (G) of any graph G. Let E(G) be an edge set of G and F = V’ (G) ∪ E(G), where V’ (G) indicates the family of all one vertex subsets of the set ...