Abstract

For a graph G, let G, L(G), J(G) S(G), L,(G) and M(G) denote Complement, Line graph, Jump graph, Splitting graph, Line splitting graph and Middle graph respectively. In this paper, we solve the graph equations L(G) =S(H), M(G) = S(H), L(G) = LS(H), M(G) =LS(H), J(G) = S(H), M(G) = S(H), J(G) = LS(H) and M(G) = LS(G). The equality symbol '=' stands for on isomorphism between two graphs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call