NIELIT 2017 July Scientist B (IT) - Section B: 3

Question

A path in graph $G$, which contains every vertex of $G$ and only once?

• A. Euler circuit
• B. Hamiltonian path
• C. Euler Path
• D. Hamiltonian Circuit

Answer 1

option B is the answer. Following is the explanation

 

● Hamiltonian path, also called a Hamilton path, is a graph path between two vertices of a graph that visits each vertex exactly once. If a Hamiltonian path exists whose endpoints are adjacent, then the resulting graph cycle is called a Hamiltonian cycle (or Hamiltonian cycle)
● An Euler path is a path that uses every edge of a graph exactly once. An Euler circuit is a circuit that uses every edge of a graph exactly once.
● An Euler path starts and ends at different vertices.
● An Euler circuit starts and ends at the same vertex.

Comments

Hamiltonian cycle starting vertex and ending vertex should be same.