Lower Bound on Number of Edges in a Simple Graph

50 Views Asked by At

Is there an expression for the lower bound of the number of edges in a Simple Graph with $V$ vertices, with $\deg (v) > m$ for all $v$?

1

There are 1 best solutions below

0
On

The number of edges is equal to the sum of the degrees divided by two.