edited by
2,823 views

1 Answer

Best answer
7 votes
7 votes

Ans D) 2e

sum of degrees of all vertices in G = 2 E

selected by
Answer:

Related questions

8 votes
8 votes
3 answers
2
go_editor asked Jun 15, 2016
3,398 views
A simple graph ( a graph without parallel edge or loops) with $n$ vertices and $k$ components can have at most$n$ edges$n-k$ edges$(n-k) (n-k+1)$ edges$(n-k) (n-k+1)/2$ e...
7 votes
7 votes
3 answers
3
go_editor asked Jun 15, 2016
5,334 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
4
go_editor asked Jun 15, 2016
8,912 views
A graph in which all nodes are of equal degree, is known asMultigraphNon regular graphRegular graphComplete graph