Chapter 4- Route Inspection

Question 1

Eulerian graph

Answer 1

One which contains a trail that includes every edge and stares and finishes at the same vertex.

Any connected graph whose certified are all even

Question 2

Semi-eulerian graph

Answer 2

One which contains a trail that includes every edge but starts and finishes at different vertices

Any connected graph with exactly two odd vertices