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 vertex vinC is mapped bijectively onto the neighbourhood of 
The term lift is often used as a synonym for a covering graph of a connected graph.
Though it may be misleading, there is no (obvious) relationship between covering graph and vertex coveroredge cover.
The combinatorial formulation of covering graphs is immediately generalized to the case of multigraphs. A covering graph is a special case of a covering complex.[1] Both covering complexes and multigraphs with a 1-dimensional cell complex, are nothing but examples of covering spacesoftopological spaces, so the terminology in the theory of covering spaces is available; say covering transformation group, universal covering, abelian covering, and maximal abelian covering.[2]
Let G = (V1, E1) and C = (V2, E2) be two graphs, and let f: V2 → V1 be a surjection. Then f is a covering map from CtoG if for each v ∈ V2, the restriction of f to the neighbourhoodofv is a bijection onto the neighbourhood of f(v) in G. Put otherwise, f maps edges incident to v one-to-one onto edges incident to f(v).
If there exists a covering map from CtoG, then C is a covering graph, or a lift, of G. An h-lift is a lift such that the covering map f has the property that for every vertex vofG, its fiber f−1(v) has exactly h elements.
In the following figure, the graph C is a covering graph of the graph H.
The covering map f from CtoH is indicated with the colours. For example, both blue vertices of C are mapped to the blue vertex of H. The map f is a surjection: each vertex of H has a preimage in C. Furthermore, f maps bijectively each neighbourhood of a vertex vinC onto the neighbourhood of the vertex f(v) in H.
For example, let v be one of the purple vertices in C; it has two neighbours in C, a green vertex u and a blue vertex t. Similarly, let v′ be the purple vertex in H; it has two neighbours in H, the green vertex u′ and the blue vertex t′. The mapping f restricted to {t, u, v} is a bijection onto {t′, u′, v′}. This is illustrated in the following figure:
Similarly, we can check that the neighbourhood of a blue vertex in C is mapped one-to-one onto the neighbourhood of the blue vertex in H:
In the above example, each vertex of H has exactly 2 preimages in C. Hence C is a 2-fold cover or a double coverofH.
For any graph G, it is possible to construct the bipartite double coverofG, which is a bipartite graph and a double cover of G. The bipartite double cover of G is the tensor product of graphs G × K2:
IfG is already bipartite, its bipartite double cover consists of two disjoint copies of G. A graph may have many different double covers other than the bipartite double cover.
For any connected graph G, it is possible to construct its universal covering graph.[3] This is an instance of the more general universal cover concept from topology; the topological requirement that a universal cover be simply connected translates in graph-theoretic terms to a requirement that it be acyclic and connected; that is, a tree. The universal covering graph is unique (up to isomorphism). If G is a tree, then G itself is the universal covering graph of G. For any other finite connected graph G, the universal covering graph of G is a countably infinite (but locally finite) tree.
The universal covering graph T of a connected graph G can be constructed as follows. Choose an arbitrary vertex rofG as a starting point. Each vertex of T is a non-backtracking walk that begins from r, that is, a sequence w = (r, v1, v2, ..., vn) of vertices of G such that
Then, two vertices of T are adjacent if one is a simple extension of another: the vertex (r, v1, v2, ..., vn) is adjacent to the vertex (r, v1, v2, ..., vn-1). Up to isomorphism, the same tree T is constructed regardless of the choice of the starting point r.
The covering map f maps the vertex (r) in T to the vertex rinG, and a vertex (r, v1, v2, ..., vn) in T to the vertex vninG.
The following figure illustrates the universal covering graph T of a graph H; the colours indicate the covering map.
For any k, all k-regular graphs have the same universal cover: the infinite k-regular tree.
An infinite-fold abelian covering graph of a finite (multi)graph is called a topological crystal, an abstraction of crystal structures. For example, the diamond crystal as a graph is the maximal abelian covering graph of the four-edge dipole graph. This view combined with the idea of "standard realizations" turns out to be useful in a systematic design of (hypothetical) crystals.[2]
Aplanar cover of a graph is a finite covering graph that is itself a planar graph. The property of having a planar cover may be characterized by forbidden minors, but the exact characterization of this form remains unknown. Every graph with an embedding in the projective plane has a planar cover coming from the orientable double cover of the projective plane; in 1988, Seiya Nagami conjectured that these are the only graphs with planar covers, but this remains unproven.[4]
A common way to form covering graphs uses voltage graphs, in which the darts of the given graph G (that is, pairs of directed edges corresponding to the undirected edges of G) are labeled with inverse pairs of elements from some group. The derived graph of the voltage graph has as its vertices the pairs (v,x) where v is a vertex of G and x is a group element; a dart from vtow labeled with the group element yinG corresponds to an edge from (v,x) to (w,xy) in the derived graph.
The universal cover can be seen in this way as a derived graph of a voltage graph in which the edges of a spanning tree of the graph are labeled by the identity element of the group, and each remaining pair of darts is labeled by a distinct generating element of a free group. The bipartite double can be seen in this way as a derived graph of a voltage graph in which each dart is labeled by the nonzero element of the group of order two.
