TOPICS
Search

Edge Cover Number


The size of a minimum edge cover in a graph G is known as the edge cover number of G, denoted rho(G).

If a graph G has no isolated points, then

 nu(G)+rho(G)=|G|,

where nu(G) is the matching number and n=|G| is the vertex count of G (Gallai 1959, West 2000).


See also

Edge Cover, Edge Cover Polynomial, Minimum Edge Cover

Explore with Wolfram|Alpha

References

Gallai, T. "Über extreme Punkt- und Kantenmengen." Ann. Univ. Sci. Budapest, Eőtvős Sect. Math. 2, 133-138, 1959.West, D. B. Introduction to Graph Theory, 2nd ed. Englewood Cliffs, NJ: Prentice-Hall, 2000.

Cite this as:

Weisstein, Eric W. "Edge Cover Number." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/EdgeCoverNumber.html

Subject classifications