0 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)$. Graph Theory isi2019-pcb-mathematics descriptive graph-theory + – admin 283 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.