The size of a minimum edge cover in a graph is known as the edge cover number of , denoted .
If a graph has no isolated points, then
where is the matching number and is the vertex count of (Gallai 1959, West 2000).
The size of a minimum edge cover in a graph is known as the edge cover number of , denoted .
If a graph has no isolated points, then
where is the matching number and is the vertex count of (Gallai 1959, West 2000).
Weisstein, Eric W. "Edge Cover Number." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/EdgeCoverNumber.html