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.