Question

You are visiting the Louvre in Paris. Consider representing the museum as a graph where the works of art are the vertices and paths between adjacent works of art are the edges. We want to see each work of art exactly once. Would this path be represented by an Euler circuit or a Hamiltonian circuit?

Write EUL for Euler circuit or HAM for Hamiltonian circuit.

ANSWER:

Answer 1

ANSWER:

Ans:: HAM

EXPLANATION:

A simple circuit in a graph G that passes throygh every vertex exactly once is a Hamiltonian circuit. So, The path to see each work of art exactly once can be represented by Hamiltonian circuit. Euler circuit starts and stops at the same vertex and it uses every edge exactly once and so, Euler circuit is not applicable in this case.

NOTE:: I hope this answer is helpfull to you......**Please suppport me with your rating

**Please give me"LIKE".....Its very important for me......THANK YOU