edge-covering number

edge-covering number

[′ej ‚kəv·ər·iŋ ‚nəm·bər]
(mathematics)
For a graph, the sum of the number of edges in a minimum edge cover and the number of isolated vertices.