In the mathematical discipline of graph theory, a graph C is a covering graph of another graph G if there is a covering map from the vertex set of C to the vertex set of G. A covering map f is a surjection and a local isomorphism: the neighbourhood of a v vertex in C is mapped bijectively onto the neighbourhood of f(v) in G.
The term lift is often used synonymous for a covering graph of a connected graph.
Note that a covering in graph theory may also refer to an unrelated concept, a subset of vertices that touches all edges.
Read more about Covering Graph: Definition, Examples, Double Cover, Universal Cover, Voltage Graphs
Famous quotes containing the words covering and/or graph:
“You had to have seen the corpses lying there in front of the school—the men with their caps covering their faces—to know the meaning of class hatred and the spirit of revenge.”
—Alfred Döblin (1878–1957)
“When producers want to know what the public wants, they graph it as curves. When they want to tell the public what to get, they say it in curves.”
—Marshall McLuhan (1911–1980)