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].