1 votes 1 votes The minimum number of edges in a connected graph with $‘n’$ vertices is equal to $n (n – 1)$ $\frac{n(n-1)}{2}$ $n^{2}$ $n – 1$ Graph Theory ugcnetcse-dec2010-paper2 graph-theory graph-connectivity + – makhdoom ghaya asked Sep 5, 2016 recategorized Oct 8, 2018 by Pooja Khatri makhdoom ghaya 4.5k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes Ans: D The minimum number of edges for undirected connected graph is (n-1) edges. For the maximum number of edges (assuming simple graphs), every vertex is connected to all other vertices which gives arise for n(n-1)/2 edges (use handshaking lemma). rishu_darkshadow answered Sep 15, 2017 selected Jul 18, 2019 by Bikram rishu_darkshadow comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes The minimum number of edges in a connected graph with n vertex is n-1 i.e. Tree. D is answer Prashant. answered Sep 5, 2016 Prashant. comment Share Follow See all 0 reply Please log in or register to add a comment.