Graph equations for line graphs, total graphs, middle graphs and quasi- total graphs (Q791547)

Let G be a simple finite and connected graph with the vertex set V(G) and the edge set X(G). Let V'(G) be the family of all one-point subsets of V(G). Both the line graph L(G) of G and the total graph T(G) of G are standard graph theoretical concepts. The middle graph M(G) of G is the intersection graph of \(V'(G)\cup X(G)\) and the quasi-total graph P(G) of G has the vertex set \(V(G)\cup X(G)\) with two vertices adjacent if and only if they correspond to two non-adjacent vertices of G or to two adjacent edges of G or to a vertex and an edge incident to it in G. The aim of this paper is to solve the following graph equations: L(G)\(\cong P(H)\); \(\overline{L(G)}\cong P(H)\); P(G)\(\cong T(H)\); \(\overline{P(G)}\cong T(H)\); M(G)\(\cong P(H)\); \(\overline{M(G)}\cong P(H)\) (by \(\cong\) the isomorphism between two graphs is meant and \(\bar G\) is the complement of G).