# ISRO2009-54

2.3k views

A graph in which all nodes are of equal degree, is known as

1. Multigraph
2. Non regular graph
3. Regular graph
4. Complete graph

recategorized

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

Ans C) Regular graph

selected
0
please tell me why not complete graph
0
2
In a complete graph all nodes have same degree. But all graphs which have same degree for all nodes are not complete. So, only regular should be the answer here.
0

You are right.But sir Question is not asking definition complete graph.

Question is asking "A graph in which all nodes are of equal degree"

Answer-For (C) Yes,In Regular Graph all nodes have equal degree.

Answer-For (D)Yes,In complete Graph all nodes have equal degree.

1
yes, but see which is LHS of the sentence. If we reverse the sentence, then yes, both C and D can be answer like

"Which graph has same degree for all the nodes"
1

yes,i got it now. All Complete Graph is Regular but not vise-versa.Thank you ## Related questions

1
1.7k 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$ edges
If G is a graph with e edges and n vertices the sum of the degrees of all vertices in G is e e/2 e$^2$ 2 e
Let $G$ be an arbitrary graph with $n$ nodes and $k$ components. If a vertex is removed from $G$, the number of components in the resultant graph must necessarily lie down between $k$ and $n$ $k-1$ and $k+1$ $k-1$ and $n-1$ $k+1$ and $n-k$