Skip to content
Related Articles

Related Articles

Improve Article
Save Article
Like Article

UGC-NET | UGC NET CS 2014 Dec – II | Question 3

  • Last Updated : 25 Jun, 2018

Consider the Graph shown below:

This graph is a __________.
(A) Complete Graph
(B) Bipartite Graph
(C) Hamiltonian Graph
(D) All of the above

Answer: (C)

Explanation: There is no edge between D and B , A and C and one more thing for complete graph edge must be n * (n – 1) / 2 which is not valid in given graph.
If a graph is two colorable then it is bipartite but this graph is not bipartite.
According to Dirac’s Theorem If each vertex have degree greater then n / 2 then it is Hamiltonian For more information on Hamiltonian Refer:Mathematics | Euler and Hamiltonian Paths
Option (C) is correct.

Quiz of this Question

My Personal Notes arrow_drop_up
Recommended Articles
Page :

Start Your Coding Journey Now!