Covering graph
Summary
In the mathematical discipline of graph theory, a graph is a covering graph of another graph if there is a covering map from the vertex set of to the vertex set of . A covering map is a surjection and a local isomorphism: the neighbourhood of a vertex in is mapped bijectively onto the neighbourhood of in .
Further reading
- Wikipedia, page 21123339, revision 1369278026, Covering graph. adopted
About this page
| Tag | 1QVTYPM0KK |
|---|---|
| URI | m2://1QVTYPM0KK |
| Aliases | graph-cover |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.