Extra

Question 1

What is Hamiltonian Graph

Answer 1

A Hamiltonian graph contains a Hamiltonian cycle.

A Hamiltonian cycle is a cycle that visits every vertex exactly once and returns to the starting vertex.

Question 2

What is semi Hamiltonian graph

Answer 2

A semi-Hamiltonian graph contains a Hamiltonian path, but not necessarily a Hamiltonian cycle.

A Hamiltonian path visits every vertex exactly once, but does not return to the starting point.

Question 3

What is a bipartite graph

Answer 3

A bipartite graph is a graph where:

The set of vertices can be divided into two distinct groups.

Edges only connect vertices from one group to the other, never within the same group.