TOPICS
Search

Root Graph


A graph G whose line graph is L(G) is called the root graph R(L(G)) of L(G). In order words, R(L(G))=G. The root graph of a connected graph is unique except for K_3=C_3 (the triangle graph), which has root graphs K_3 and K_(1,3) (the claw graph) (Harary 1994, pp. 72-73).


See also

Line Graph

Explore with Wolfram|Alpha

References

Harary, F. Graph Theory. Reading, MA: Addison-Wesley, 1994.Whitney, H. "Congruent Graphs and the Connectivity of Graphs." Amer. J. Math. 54, 150-168, 1932.

Cite this as:

Weisstein, Eric W. "Root Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/RootGraph.html

Subject classifications