A minimum edge cover is an edge cover having the smallest possible number of edges for a given graph. The size of a minimum edge cover of a
graph is known as the edge cover number of and is denoted .

A minimum edge cover of a graph can be computed in the Wolfram Language with FindEdgeCover[g].
There is currently no Wolfram Language
function to compute all minimum edge covers of a graph.