edited by
8,907 views

1 Answer

Best answer
8 votes
8 votes

A graph in which all nodes are of equal degree is known as a Regular Graph.

Ans C) Regular graph

edited by
Answer:

Related questions

8 votes
8 votes
3 answers
1
go_editor asked Jun 15, 2016
3,397 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
2
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
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$