recategorized by
4,518 views

2 Answers

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).

selected by
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

Related questions

2 votes
2 votes
1 answer
1
makhdoom ghaya asked Sep 5, 2016
7,499 views
An undirected graph possesses an eulerian circuit if and only if it is connected and its vertices areAll of even degreeAll of odd degreeOf any degreeEven in number
2 votes
2 votes
1 answer
2
makhdoom ghaya asked Aug 13, 2016
2,192 views
McCabe’s cyclomatic metric $V(G)$ of a graph $G$ with $n$ vertices, $e$ edges and $p$ connected component is$e$ $n$ $e – n + p$ $e – n + 2p$
3 votes
3 votes
1 answer
3
makhdoom ghaya asked Aug 12, 2016
761 views
Maximum number of edges in a n -Node undirected graph without self loop is$n^{2}$$n(n – 1)$ $n(n + 1)$$\frac{n(n - 1)}{2}$
1 votes
1 votes
1 answer
4
go_editor asked Jul 11, 2016
4,622 views
Consider the tree given below:Using the property of eccentricity of a vertex, find every vertex that is the centre of the given tree:d & hc & kg, b, c, h, i, mc & h