The Gateway to Computer Science Excellence
First time here? Checkout the FAQ!
x
+7 votes
1.7k 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
asked in Graph Theory by Veteran (96.1k points)
recategorized by | 1.7k 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

answered by Veteran (111k points)
selected by
0
please tell me why not complete graph
0
@Arjun sir what about this?
+1
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

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
49,532 questions
54,126 answers
187,326 comments
71,046 users