Noun
edge covering number (plural edge covering numbers) (graph theory) The number of edges in a minimum edge cover of a graph, often denoted as ρ = ρ ( G ) {\displaystyle \rho =\rho (G)} .