search
Log In
7 votes
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
in Graph Theory
recategorized by
2.3k views

1 Answer

8 votes
 
Best answer

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

Ans C) Regular graph


selected by
0
please tell me why not complete graph
0
@Arjun sir what about this?
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 yousmiley

Answer:

Related questions

6 votes
2 answers
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
asked Jun 15, 2016 in Graph Theory jothee 1.7k views
6 votes
3 answers
2
2k views
In a graph G there is one and only one path between every pair of vertices then G is a Path Walk Tree Circuit
asked Jun 15, 2016 in Graph Theory jothee 2k views
6 votes
1 answer
3
1.5k views
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
asked Jun 15, 2016 in Graph Theory jothee 1.5k views
41 votes
3 answers
4
5.7k views
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$
asked Sep 16, 2014 in Graph Theory Kathleen 5.7k views
...