vertex covering number

The vertex cover number is the size of a minimum vertex cover in a graph G is known as the vertex cover number of G, denoted τ(G). The König-Egeváry theorem states that the matching number (i.e., size of a maximum independent edge set) and vertex cover number are equal for a bipartite graph. The independence number α(G) of a graph G and vertex cover number are related by α(G) + τ(G) = left bracketing bar G right bracketing bar , where n = left bracketing bar G right bracketing bar is the vertex count.

independence number | minimum vertex cover | vertex cover | vertex cover polynomial