Covering (graph theory)

From Wikipedia, the free encyclopedia

In the mathematical discipline of graph theory a covering for a graph is a set of vertices (or edges) so that the elements of the set are close (adjacent) to all edges (or vertices) of the graph.

We are especially interested in finding small sets with this property. The problem of finding the smallest vertex covering is called the vertex cover problem and is NP-complete.

Coverings with vertices and edges are closely related to independent sets and matchings.

1 Definition
2 Examples
3 Properties
4 References
5 External links

[edit] Definition

A vertex covering for a graph $G$ is a set of vertices $V$ so that every edge of $G$ is incident to at least one vertex in $V$ . The minimum vertex covering the smallest vertex cover. We say $V$ covers the edges of the graph. The vertex covering number $ω V (G)$ for a graph $G$ is the size of the minimum vertex covering.

An edge covering for a graph $G$ is a set of edges $E$ so that every vertex of $G$ is adjacent to at least one edge in $E$ . The minimum edge covering the smallest edge cover. We say $E$ covers the vertices of the graph. The edge covering number $ω E (G)$ for a graph $G$ is the size of the minimum edge covering.

When speaking about covering we usually refer to vertex covering.

[edit] Examples

For any graph $G$ the set of its vertices (edges) is trivially a vertex covering (edge covering)
A complete bipartite graph $G m, n$ has $ω V (G m, n) = min{m, n}$ and $ω E (G m, n) = max{m, n}$