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. Note that a covering in graph theory may also refer to an unrelated concept, a subset of vertices that touches all edges.
| Property | Value |
|---|
| dbpedia-owl:thumbnail
| |
| dbpprop:abstract
|
- 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. Note that a covering in graph theory may also refer to an unrelated concept, a subset of vertices that touches all edges.
|
| dbpprop:reference
| |
| rdfs:comment
|
- 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. Note that a covering in graph theory may also refer to an unrelated concept, a subset of vertices that touches all edges.
|
| rdfs:label
| |
| skos:subject
| |
| foaf:depiction
| |
| foaf:page
| |
![[RDF Data]](/statics/sw-cube.png)
