Scribd
Upload
40 views23 pages

Euler and Hamiltonian Graph

The document discusses Euler and Hamiltonian graphs and paths/circuits. It defines what an Euler and Hamiltonian path/circuit are and presents theorems about when a graph contains an Euler path/circuit based on the degrees of its vertices. It also discusses indegree and outdegree in directed graphs and defines Hamiltonian graphs.

Uploaded by

lms vb
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
40 views23 pages

Euler and Hamiltonian Graph

The document discusses Euler and Hamiltonian graphs and paths/circuits. It defines what an Euler and Hamiltonian path/circuit are and presents theorems about when a graph contains an Euler path/circuit based on the degrees of its vertices. It also discusses indegree and outdegree in directed graphs and defines Hamiltonian graphs.

Uploaded by

lms vb
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/ 23

Euler and Hamiltonian Graph

Path
Circuit
Connected and Disconnected Graph
Connected and Disconnected Graph

a : Connected Graph

b : Disconnected Graph
Eulerian Paths and Circuits
Euler Path
• An Euler path is a path that uses every edge in
a graph with no repeats. Being a path, it does
not have to return to the starting vertex.
Euler Path
Euler Circuit
• An Euler circuit is a circuit that uses every
edge in a graph with no repeats. Being a
circuit, it must start and end at the same
vertex.
Euler Circuit
A result related to Degree of vertices

• In Graph Theory, Handshaking Theorem states


in any given graph, Sum of degree of all the
vertices is twice the number of edges
contained in it.
A result related to Degree of vertices
• Given G is an undirected graph, the degree of
a vertex v, denoted by deg(v), in graph G is the
number of neighbors of v.
The number of vertices of odd degree in any
graph G is even.
Theorems
• Euler’s Path and Circuit Theorems

– A graph will contain an Euler path if it contains at


most two vertices of odd degree.
– A graph will contain an Euler circuit if all vertices
have even degree
Corollary
• An undirected graph possesses an eulerian
circuit if and only if it is connected and its
vertices are all of even degree.

Determine above graphs have euler path or circuit based on


degree of vertices.
Euler Graph
• Any connected graph is called as an Euler
Graph if and only if all its vertices are of even
degree.
OR
• An Euler Graph is a connected graph that
contains an Euler Circuit.
Directed Graph – indegree and
outdegree
• Indegree – Number of edges incident into the
vertex.

• Outdegree – Number of edges incident from


the vertex.
Hamiltonian Paths and Circuits
Hamiltonian Graph
• Any connected graph that contains a
Hamiltonian circuit is called as a Hamiltonian
Graph.
Identify : Euler graph and Hamiltonian
graph
Identify : Euler graph and Hamiltonian
graph

You might also like