Scribd
Upload
182 views

Revision Notes - Eulerian and Semi-Eulerian Graphs

Uploaded by

bosonhiggs49
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
182 views

Revision Notes - Eulerian and Semi-Eulerian Graphs

Uploaded by

bosonhiggs49
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Revision Notes: Eulerian and Semi-Eulerian Graphs

1. Eulerian Graphs

● Definition: An Eulerian graph is a connected graph where every vertex has an even
degree (number of edges incident to it).
● Eulerian Circuit: An Eulerian circuit is a circuit that visits every edge exactly once and
returns to the starting vertex.
● Eulerian Path: An Eulerian path is a path that visits every edge exactly once but may
not necessarily return to the starting vertex.

2. Properties of Eulerian Graphs

● Degree Condition: In an Eulerian graph, every vertex must have an even degree. If
there are exactly two vertices with odd degrees, the graph contains an Eulerian path
starting at one of these vertices.
● Connectedness: An Eulerian graph must be connected. Disconnected graphs or graphs
with more than two vertices with odd degrees cannot be Eulerian.

3. Euler's Theorem for Eulerian Graphs

● Euler's Theorem: A connected graph is Eulerian if and only if all vertices have even
degree.

4. Examples

● Example 1: Graph with vertices A,B,C,DA, B, C, DA,B,C,D and edges


AB,BC,CD,DA,ACAB, BC, CD, DA, ACAB,BC,CD,DA,AC is Eulerian because each
vertex has degree 2.
● Example 2: Graph with vertices A,B,C,DA, B, C, DA,B,C,D and edges AB,BC,CD,DAAB,
BC, CD, DAAB,BC,CD,DA is not Eulerian because vertices BBB and DDD have odd
degrees.

5. Semi-Eulerian Graphs

● Definition: A semi-Eulerian graph has exactly two vertices of odd degree, allowing for
an Eulerian path but not an Eulerian circuit.
● Applications: Semi-Eulerian graphs are useful in planning routes or circuits where only
one path needs to visit each edge exactly once.

6. Finding Eulerian Paths and Circuits

● Hierholzer's Algorithm: Algorithm used to find Eulerian circuits and paths in graphs.
● Steps:
○ Ensure all vertices are of even degree or exactly two vertices have odd degree.
○ Start from a vertex with odd degree for an Eulerian path, or any vertex for an
Eulerian circuit.
○ Trace edges while removing them until returning to the starting vertex.

7. Examples of Semi-Eulerian Graphs

● Example 1: Graph with vertices A,B,C,DA, B, C, DA,B,C,D and edges


AB,BC,CD,DA,AC,BDAB, BC, CD, DA, AC, BDAB,BC,CD,DA,AC,BD is semi-Eulerian
because vertices BBB and DDD have odd degrees.
● Example 2: Graph with vertices A,B,C,DA, B, C, DA,B,C,D and edges
AB,BC,CD,DA,ACAB, BC, CD, DA, ACAB,BC,CD,DA,AC is Eulerian, not semi-Eulerian,
as all vertices have even degrees.

8. Real-World Applications

● Transportation Networks: Planning optimal routes and circuits.


● Circuit Design: Layout of electrical circuits ensuring connectivity and efficiency.

9. Computational Complexity

● Algorithmic Challenges: Efficient algorithms are crucial due to the complexity of


checking degrees and connectivity in large graphs.

10. Summary

● Eulerian Graphs: All vertices have even degrees, allowing for Eulerian circuits or paths.
● Semi-Eulerian Graphs: Exactly two vertices have odd degrees, permitting Eulerian
paths but not circuits.

Understanding Eulerian and semi-Eulerian properties helps in graph theory applications, from
optimizing transportation routes to designing efficient circuits and networks.

You might also like