minimum edge cover

minimum edge cover

[‚min·ə·məm ′ej ‚kəv·ər] (mathematics) An edge cover of a graph such that there is no other edge cover with fewer vertices.