Covering Graph
A covering graph can refer to two graph-theoretic notions.
In some line graph terminology, a covering graph is a line graph (Gross and Yellen 2006, p. 20).
In graph covering theory, a covering graph is a graph cover, i.e., a graph that maps locally bijectively onto a base graph (Gross and Tucker 1987). In plainer language, it is a graph whose edges around each lifted vertex correspond one-to-one with the edges around its image in the base graph.
See also
Graph Cover, Line GraphExplore with Wolfram|Alpha
WolframAlpha
References
Gross, J. L. and Tucker, T. W. Topological Graph Theory. New York: Wiley, 1987.Gross, J. T. and Yellen, J. Graph Theory and Its Applications, 2nd ed. Boca Raton, FL: CRC Press, p. 20, 2006.Referenced on Wolfram|Alpha
Covering GraphCite this as:
Weisstein, Eric W. "Covering Graph." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CoveringGraph.html