A path between two vertices of a graph that visits each vertex of the graph exactly once

Question:

A path between two vertices of a graph that visits each vertex of the graph exactly once is called an Euler path.

a. True

b. False

Step by Step Answer:

Related Book For  book-img-for-question
Question Posted: