CHP 4: Route Inspection - Key Terminology

Question 1

What is a EULARIAN graph?

Answer 1

A graph which contains a trail that includes every edge and starts and finishes at the same vertex. (This trail is called an Eularian Circuit)

Any connected graph with all even degree vertices are Eularian.

Question 2

What is a SEMI-EULARIAN graph?

Answer 2

A graph which contains a trail that includes every edge but starts and finishes at different vertices.

Any connected graph with exactly 2 odd vertices is semi-Eularian.