A graph in which all nodes are of equal degree is known as
- A. Multigraph
- B. Non regular graph
- C. Regular graph
- D. Complete graph
Answer: C. Regular graph
Explanation: In a k-regular graph, every vertex has degree k.
All ISRO Computer Science (CSE) papers | ISRO Computer Science (CSE) 2009
A graph in which all nodes are of equal degree is known as
Answer: C. Regular graph
Explanation: In a k-regular graph, every vertex has degree k.
Previous question | Next question | All questions of ISRO Computer Science (CSE) 2009