Scribd
Upload
117 views19 pages

Graph Theory Lecture 5 and 6

The document discusses various graph theory concepts including semi-Euler graphs, Eulerian graphs, Fleury's algorithm, Hamiltonian graphs, maximal non-Hamiltonian graphs, Dirac's theorem, and bipartite graphs.

Uploaded by

Vishnu Kumar Reddy Bobbiti
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
117 views19 pages

Graph Theory Lecture 5 and 6

The document discusses various graph theory concepts including semi-Euler graphs, Eulerian graphs, Fleury's algorithm, Hamiltonian graphs, maximal non-Hamiltonian graphs, Dirac's theorem, and bipartite graphs.

Uploaded by

Vishnu Kumar Reddy Bobbiti
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/ 19

OE2C09: Graph Theory

Dr. Durgesh Singh

Assistant Professor
Department of Computer Science & Engineering
PDPM, IIITDM Jabalpur (M.P.) – 482005
Semi-Euler Graph
 If a connected graph contains an Euler trail but does not contain an
Euler circuit, then such a graph is called as a semi-Euler graph.

Euler trail: B C D B A D

Note: If the number of vertices with odd degree are at most 2, then graph
contains an Euler trail otherwise not.
A connected graph or multigaph G is Eulerian if
and only if every vertex has even degree.
Proof:
Assume G is a connected Eulerian graph.
Let w: u – u be an Eular path
Let v ≠ u be a vertex that occurs k times in Euler path w.

Every time an edge arrives at v, another edge exits from v,


So, d(v)= 2k (an even integer)
Also, d(u) is even, since w starts and ends at u.

Thus if G is an Euler graph, the degree of every vertex is even.


( ) To prove the sufficiency of the condition, assume G is a connected
graph such that d(v) is even for all V(G)
Then select a vertex and form an Eulerian trail strating that vertex.
Fleury’s Algorithm
 Fleury’s algorithm is used to find a Euler Path or a Euler Circuit in a
connected graph.
 Bridge: Bridge is an edge such that removing it from the graph
disconnects the graph into 2 connected components. A bridge can
never be part of a cycle.
 When there are two edges, one is bridge, another one is non-bridge,
we have to choose non-bridge at first.
 In this algorithm, starting from one vertex, it tries to move other
adjacent vertices.
 At each step, we move across an edge where deletion does not result
in more than one component, unless we have no choice.
 At the end of algorithm, there are no edges left and the sequence of
edges we moved across form a Eulerian trail.
 If the graph contains an Euler Circuit, then the path will end at the
starting vertex.
Let a graph G in which every vertex has even degree
 Corollary: A connected multi-graph G is semi-Eulerian if and only if
there are exactly 2 vertices of odd degree.
Hamiltonian Graph
 A Hamiltonian cycle (or Hamiltonian circuit) in the connected graph G
is a Cycle that contains all the vertices of the graph.
 A Hamiltonian path (or spanning path) in the connected graph G is a
a Path that contains all the vertices of the graph.
 A closed Hamiltonian path is called as a Hamiltonian cycle.

 A graph is a Hamiltonian graph if it contains a Hamiltonian cycle

Note: In Hamiltonian path, all the edges may or may not be covered but
edges must not repeat.
examples
 Cycle graph 𝐶𝑛 is Hamiltonian for any n ≥ 3

 Complete Graph 𝐾𝑛 is Hamiltonian for any n ≥ 3.


 A Hamiltonian cycle in a graph of n vertices consists of exactly n
edges.
 The length of a Hamiltonian path (if it exists) in a connected graph of
n vertices is n-1.
 In considering the existence of a Hamiltonian circuit (or path), we need
only consider simple graphs.
 Thisis because a Hamiltonian circuit (or path) traverses every vertex exactly
once. Hence it cannot include a self-loop or a set of parallel edges. Thus, a
general graph may be made simple by removing parallel edges and self-
loops before looking for a Hamiltonian circuit in it.
 The question: What is a necessary and sufficient condition for a
connected graph G to have a Hamiltonian circuit? (NP complete
Problem)
 This problem, first posed by the famous Irish mathematician Sir William
Rowan Hamilton in 1859, is still unsolved.
 There is no known criterion we can apply to determine the existence of
a Hamiltonian cycle in general.
Maximal non Hamiltonian Graph
 A simple graph G is called maximal non- Hamiltonian graph if it is not
Hamiltonian and the addition of an edge between any two non
adjacent vertices of it forms a Hamiltonian graph.
 Example:
Theorem
 Dirac's Theorem - If G is a simple graph with n vertices, where n ≥ 3
If deg(v) ≥ n/2 for each vertex v, then the graph G is Hamiltonian
graph.
 Dirac's Theorem provides only sufficient condition for a connected
simple graph to have Hamiltonian cycle
 Do not provide the necessary condition for the existence of a
Hamiltonian cycle
Example
 C4, C5, C6
Ore’s Theorem:
 If G is a simple graph with n vertices, where n ≥ 3 if deg(x) + deg(y)
≥ n for each pair of non-adjacent vertices x and y, then the graph G
is Hamiltonian graph.
Bipartite Graph
 A bipartite graph is a graph whose vertices can be divided into two
parts A and B such that every edge connects a vertex in A to a
vertex in B.
Let G=(V, E) be bipartite. Then, V=A∪B such that A∩B=∅ and that all
edges e∈ E are such that e is of the form {a, b} where a ∈A and b ∈B.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy