in Others edited by
17 views
0 votes
0 votes
Let $m$ be a fixed integer greater than $2.$ Prove that all simple graphs having $n\;(n \geq 3)$ vertices and with $m$ edges are connected if and only if $m>\left(\begin{array}{c}n-1 \\ 2\end{array}\right)$.
in Others edited by

Please log in or register to answer this question.

Related questions