edited by
3,396 views

3 Answers

8 votes
8 votes

Ans D)

graph with n vertices and k component has (n-k) ≤ e ≤(n-k)(n-k+1)/2 edges

0 votes
0 votes
Take an example of a complete graph on 4 vertices, no. of components =1 and no. of edges =6 which is satisfied by option D.
Answer:

Related questions

7 votes
7 votes
3 answers
1
go_editor asked Jun 15, 2016
5,331 views
In a graph $\text{G}$ there is one and only one path between every pair of vertices then $\text{G}$ is aPathWalkTreeCircuit
9 votes
9 votes
1 answer
2
go_editor asked Jun 15, 2016
8,907 views
A graph in which all nodes are of equal degree, is known asMultigraphNon regular graphRegular graphComplete graph
65 votes
65 votes
5 answers
3
8 votes
8 votes
1 answer
4
go_editor asked Jun 15, 2016
2,823 views
If $\text{G}$ is a graph with e edges and n vertices the sum of the degrees of all vertices in $\text{G}$ is$e$$e/2$$e^2$$2 e$