Pundra University of Science & Technology

Presentation Profile of
Md. Rakibul Hasan
Dep: CSE
Roll:13
Batch:6th
Presentation Topics is:
1.Euler Theorem and
2.Hamilton Theorem
 Euler Theorem
• Euler Circuit: An euler circuit in a graph G is a
simple circuit containing every edge of G.
Example:
a b

d e

That means :a b c c c d c ec a
 Euler Theorem
Euler path: An euler path in G a simple path
containing edge of G.
Example:
a b

c d
e That is :a c e d b
 Euler Theorem
Note: When both condition are not comes to
true that situation is called no ckt and no path.
Example: a b
one edge is left
so no ckt and
no path
 Hamilton Theorem
Hamilton Circuit: A simple circuit in graph G that
passing though the every vertex exactly once
that is called a Hamilton circuit.
Example: a b
 Hamilton Theorem
• Hamilton path: A simple path in a graph G that
passing though the every vertex exactly once
that is called Hamilton path.
• Example: a b
 Hamilton Theorem
• Note: when both condition are no comes to
true that situation is called no ckt and no path.
• Example : a b c
•

d e f g h
• THANK YOU…………