---
tag: 1QVTYPM0KK
kind: concept
name: Covering graph
aliases: [graph-cover]
sources:
  - wikipedia: en:21123339@r1369278026
    locator: Covering graph
    note: adopted
    mention: wikipedia://en/21123339
    sections: [Summary]
same_as:
  wikidata: Q5179252
  wikipedia: Covering graph
inventory: [4TXK9Z6S4J]
---

## Summary

In the mathematical discipline of graph theory, a [[graph|00C0BR7D7H]] $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 $v$ in $C$ is mapped [[bijectively|0GG9TVW90M]] onto the neighbourhood of $f(v)$ in $G$.