edge covering number

The size of a minimum edge cover in a graph G is known as the edge cover number of G, denoted ρ(G). If a graph G has no isolated points, then ν(G) + ρ(G) = left bracketing bar G right bracketing bar , where ν(G) is the matching number and n = left bracketing bar G right bracketing bar is the vertex count of G.

edge cover | edge cover polynomial | minimum edge cover