Question

A circuit in a connected graph is an Eulerian circuit if it contains

• A. Every node of the graph
• B. Every edge of the graph
• C. Every node exactly once
• D. Every edge at least once

Hint:

Eulerian circuits require all edges to be visited once and all vertices to have even degree.

Answer 1

The Correct Option is B

An Eulerian circuit is a cycle that visits every edge **exactly once** in a connected graph and returns to the starting vertex. A connected graph contains an Eulerian circuit if and only if every vertex has an even degree.