NICNIELIT STA 2020
October 7, 2023UGC NET CS 2014 DecPaper2
October 7, 2023UGC NET CS 2014 DecPaper2
Question 3

Consider the Graph shown below :
This graph is a __________.
This graph is a __________.
Complete Graph


Bipartite Graph


Hamiltonian Graph


All of the above

Question 3 Explanation:
OptionA: It is not complete graph because it won’t have n(n1)/2 edges.
OptionB: It is not Bipartite Graph because it takes more than 2 colours. Bipartite Graph have exactly 2 colours.
OptionC: Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once.
Hence, OptionC is correct answer.
OptionB: It is not Bipartite Graph because it takes more than 2 colours. Bipartite Graph have exactly 2 colours.
OptionC: Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once.
Hence, OptionC is correct answer.
Correct Answer: C
Question 3 Explanation:
OptionA: It is not complete graph because it won’t have n(n1)/2 edges.
OptionB: It is not Bipartite Graph because it takes more than 2 colours. Bipartite Graph have exactly 2 colours.
OptionC: Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once.
Hence, OptionC is correct answer.
OptionB: It is not Bipartite Graph because it takes more than 2 colours. Bipartite Graph have exactly 2 colours.
OptionC: Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once.
Hence, OptionC is correct answer.
Subscribe
Login
0 Comments