Scribd
Upload
280 views11 pages

Eulerian Graph Final

This document discusses Eulerian graphs and related concepts: 1) It defines a graph as a collection of vertices connected by edges, and defines key graph terms like paths, walks, and loops. 2) It introduces the concepts of an Euler path, which uses each edge once while allowing repeated vertices, and an Euler circuit, which both uses each edge once and starts/ends at the same vertex. 3) It describes Eulerian graphs as connected graphs that contain an Euler circuit, and provides examples of Euler paths, circuits, and graphs.

Uploaded by

Bishal Patangia
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
280 views11 pages

Eulerian Graph Final

This document discusses Eulerian graphs and related concepts: 1) It defines a graph as a collection of vertices connected by edges, and defines key graph terms like paths, walks, and loops. 2) It introduces the concepts of an Euler path, which uses each edge once while allowing repeated vertices, and an Euler circuit, which both uses each edge once and starts/ends at the same vertex. 3) It describes Eulerian graphs as connected graphs that contain an Euler circuit, and provides examples of Euler paths, circuits, and graphs.

Uploaded by

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

EULERIAN GRAPH

SUBMITTED BY:

NAME: BISHAL PATANGIA


ROLL NO : 16
PPT OF MATHEMATICS
BCA 3rd SEM,CCSA
1
WHAT IS A GRAPH?
A graph is a collection of vertices connected to each other through a set of edges.
Graphs consist of
a b
• points called vertices
• lines called edges
• 1. Edges connect two
vertices.
2. Edges only intersect
at vertices. c
d
3. Edges joining ac Fig : A graph with abcd vertices
vertex to itself are
called loops.

2
THE PREREQUISITE
Connected Graph:

A graph is connected if it is possible to travel from any other node along a sequence of edges in the graph.
a

b c
Path:
An open walk in which no vertex appear more than one is called path.

Walk:
A walk consists of an alternating sequence of vertices and edges consecutive elements of which are incident,
that begins and ends with a vertex.
Closed walk:
When a walk begins and ends at the same vertex it is called closed walk.

3
EULER PATH AND EULER CIRCUIT:

Euler path: A path is called euler path if it contains every edges exactly once where
vertices may be repeated.
A euler path starts and ends at the different vertex.
Euler circuit/cycle: If there exists a walk in the connected graphs that starts and ends
at the same vertex and visits every edge of the graph exactly once with or without
repeating the vertices, then such a walk is called as an Euler circuit.
B C
Examples:
A

E D
An Euler path: BBADCDEBC
An Euler circuit: CDCBBADEBC
4
EULER GRAPH:
A graph ‘G’ which contains a euler cycle is called euler graph. Essentially a graph is
considered Eulerian if you can
start at a vertex,a traverse through
e every edge only
a once, and return to the same
b
vertex you started at.
Examples:
f c
d
b c

e d

Fig: Eulerian Graph

Here at first we go to ab,bc,cd,de,ec,ca.

5
SEVEN BRIDGES OF KONIGSBERG:

Fig : Konigsberg Graph

6
One of the oldest problem involving graphs is the
Konigsberg bridge problem. There were two islands linked
to each other and to the banks of the river shown in fig.The
problem was to begin at any of the four land areas to walk
across each bridge once and to return to the same point.
Leonhard Euler drew a graph like shown in the figure .
It wasn’t until a few years later that the problem was proved
to have no solution by Leonhard Euler.

7
Determining if a Graph is Eulerian
Theorem: A non empty connected graph G is Eulerian if and only if its vertices are of
even degree.

Theorem: A connected graph contains an Euler trail, but not an Euler circuit, if and
only if it has two vertices of odd degree.
Note
To determine whether a graph G has an Euler circuit,we note the points:
1. List the degree of all vertices in the graph.
2. If all the degrees are even,then G has both Euler trail and Euler circuit.
3. If exactly two vertices are odd degree,then G has Euler trail but no Euler circuit.
4. If any value is zero, then the graph is not connected.

8
Semi Euler Graph:
If a connected graph contains an Euler path but does not contain Euler circuit,then
such a graph is called as a semi-euler graph.
Examples:
a b

d c
V1 V2
Example: Let G be a graph in the fig 1.Verify that G has an Euler circuit.
Solution: We observe that G is connected and all the vertices are having even
Degree deg(v1)=deg(v2)=deg(v4)=deg(v5)=2.
Thus G has a Euler circuit. By inspection, we find Euler circuit. V3
v1-v3-v5-v4-v3-v2-v1

V4 V5
9
Fleury’s Algorithm for finding Euler circuit

• First make sure that the graph is connected and all


the vertices have even degree.
• Pick any vertex as the stating point
• When you have a choice, always choose to travel
along an edge that is not a bridge of the yet-to-betraveled
part of the graph
• Label the edges in the order in which we travel them
• When we cannot travel any more, stop. we are done.

10
THANK YOU

You might also like