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

A

Complete Graph

B

Bipartite Graph

C

Hamiltonian Graph

D

All of the above

Question 3 Explanation:

Option-A: It is not complete graph because it won’t have n(n-1)/2 edges.
Option-B: It is not Bipartite Graph because it takes more than 2 colours. Bipartite Graph have exactly 2 colours.
Option-C: Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once.
Hence, Option-C is correct answer.

Correct Answer: C

Question 3 Explanation:

Option-A: It is not complete graph because it won’t have n(n-1)/2 edges.
Option-B: It is not Bipartite Graph because it takes more than 2 colours. Bipartite Graph have exactly 2 colours.
Option-C: Hamiltonian path is a path in an undirected or directed graph that visits each vertex exactly once.
Hence, Option-C is correct answer.