• edge covering number

edge covering number (suomeksi)

Määritelmät:

• (lb, en, graph theory) The number of edges in a minimum edge cover of a graph, often denoted as $\backslash rho\; =\; \backslash rho(G)$.