Scribd
Upload
5 views2 pages

BEMA56A Unit-IV 02

Uploaded by

Naga Rajan K
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
5 views2 pages

BEMA56A Unit-IV 02

Uploaded by

Naga Rajan K
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

Graph Theory BEMA56A-Unit IV-02

GRAPH THEORY
Unit-IV
Eulerian graph (cont.)
Corollary:
Let be a connected graph wilh cxactly odd vertices. Then the edge set of can
be partitioned into open trails.
Proof.
Let the odd vertices of be labelled in any arbitrary order. Add
edges to between the vertex pairs to form a new graph ( may be
a multigraph). No two of these edges are incident with the same vertex. Further every vertex of
is of even degree and hence has an Eulerian trail . If the edges that we added to are now
removed from , it will split into open trails (since no two of these edges are adjacent). These are
open trails in and form a partition of the edges of .

Corollary:
Let be a connected. graph with exactly two odd vertices. Then has an open trail
containing all the vertices and edges of G .

Arbitrarily traversable
A graph is said to be arbitrarily traversable (traceable) from a vertex $v$ if the following
procedure always results in an Eulerian trail.
Start at by traversing any incident edge. On arriving at a vertex , depart through any
incident edge not yet traversed and continue until all the lines are traversed.
If a graph is arbitrarily traversable from a vertex then it is obviously eulerian.

The above graph is arbitrarily traversable from . From no other point it is

Theorem:
An eulerian graph is arbitrary traversable from a vertex in iff every cycle in
contains

Jawahar Science College, Block-14, Neyveli. Page 1 of 2


Graph Theory BEMA56A-Unit IV-02

Fleury's algorithm
1. Choose an arbitrary vertex and set .
2. Suppose that the trail has been chosen. Then choose an edge from
in such a way that
(i) is incident with
(ii) Unless there is no alternative, is not a bridge of
3. Stop when Step 2 can no longer be implemented.

Obviously, Fleury's algorithm construct a trail in . It can be proved that if is eulerian,


then any trail in constructed by Fleury's algorithm is an eulerian trail in .

Jawahar Science College, Block-14, Neyveli. Page 2 of 2

You might also like