|
|
|
|
edge covering
|
(Definition)
|
|
|
Let $G$ be a graph. An edge covering $C$ on $G$ is a subset of the vertices of $G$ such that each edge in $G$ is incident with at least one vertex in $C$
For any graph, the vertex set is a trivial edge covering. Generally, we are more interested in minimal coverings. A minimal edge covering is simply an edge covering of the least possible .
|
"edge covering" is owned by vampyr.
|
|
(view preamble | get metadata)
See Also: matching
| Also defines: |
minimal edge covering |
|
|
Cross-references: coverings, minimal, incident, edge, vertices, subset, graph
There is 1 reference to this entry.
This is version 5 of edge covering, born on 2002-05-26, modified 2002-07-06.
Object id is 2940, canonical name is EdgeCovering.
Accessed 4301 times total.
Classification:
| AMS MSC: | 05C70 (Combinatorics :: Graph theory :: Factorization, matching, covering and packing) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
