Scribd
Upload
12 views75 pages

Lecture 6

The document is a lecture on Graphs in Discrete Mathematics, covering various topics such as graph models, types of graphs, graph isomorphism, Euler and Hamiltonian graphs and paths. It explains the definitions, characteristics, and examples of undirected, directed, complete, bipartite, Euler, and Hamiltonian graphs. Additionally, it discusses the conditions for Euler circuits and paths, as well as the significance of connectivity in graphs.

Uploaded by

stefanboateng3
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
12 views75 pages

Lecture 6

The document is a lecture on Graphs in Discrete Mathematics, covering various topics such as graph models, types of graphs, graph isomorphism, Euler and Hamiltonian graphs and paths. It explains the definitions, characteristics, and examples of undirected, directed, complete, bipartite, Euler, and Hamiltonian graphs. Additionally, it discusses the conditions for Euler circuits and paths, as well as the significance of connectivity in graphs.

Uploaded by

stefanboateng3
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/ 75

Discrete Mathematics

Lecture 5
Graphs
Outline
Graph Models
Types of Graphs
Representation of Graphs
Graph Isomorphism
Euler Graph/Paths
Hamilton Graph/Paths
Graphs
Graph Models
Graph Models
Graph Models
Collaborative Graphs
Information Graphs
Transportation Graphs
Transportation Graphs
Graphs
Definition of a graph
Graphs: basics
Terminology
Graph characteristics: Undirected
graphs
Undirected Graphs
Undirected Graphs
Undirected Graphs
Undirected Graphs
Directed Graphs
Directed Graphs
Directed Graphs
Directed Graphs
Complete Graphs
A Cycle
Bipartite Graphs
Bipartite Graphs
Bipartite Graphs
Bipartite Graphs
Bipartite Graphs and Matching
Complete Bipartite
Graphs
Subgraphs
Subgraphs
Union of the graphs
Representation of graphs
Representation of graphs
Adjacency Matrices
Adjacency Matrices
Graph Isomorphism
Graph Isomorphism
Example 2:
Are the two graphs
isomorphic?
Graph Isomorphism
Example 3:
Show that the following two graphs are
isomorphic.
Graph Isomorphism
Graph Isomorphism
Example 4:
Are the two graphs
are isomorphic?
Graph Isomorphism
Connectivity in graphs, paths
The removal of a cut vertex, sometimes
called cut points or articulation points, and
all its adjacent edges produce a subgraph
that is not connected.

Likewise, removing a cut edge, commonly


called a bridge, also makes a disconnected
graph.
Connectivity in graphs,
paths
Hamiltonian Graph
If a graph has a closed walk in a connected
graph, which passes each and every vertex
of the graph exactly once except the root
vertex or starting vertex, then the graph is
known as a Hamiltonian graph.

A graph will be known as a Hamiltonian


graph if there is a connected graph, which
contains a Hamiltonian circuit.
Hamiltonian Graph
Hamiltonian Graph
Hamiltonian Path
It is a path that passes each and every
vertex of a graph only once.
In this path, the edges should not be
repeated.
In other words, if a connected graph
contains a Path with all the vertices of the
graph, this type of path is known as the
Hamiltonian path.
Hamiltonian Graph
Example 1: determine whether this graph contains a
Hamiltonian path

Hamiltonian path = ABCED


Hamiltonian Graph
Example 2: determine whether this graph contains a Hamiltonian
path.

Hamiltonian path = EABCD


Hamiltonian Graph
Example 3: determine whether this graph contains a
Hamiltonian path.

Hamiltonian path = ???


Hamiltonian Graph
Hamiltonian Circuit
In a connected graph, if there is a path that
passes each and every vertex of the graph
only once and after completing the walk,
return to the starting vertex, then this type
of walk will be known as a Hamiltonian
circuit.

A Hamiltonian circuit is also known as the


Hamiltonian cycle.
Hamiltonian Graph
Hamiltonian Circuit
• If there is a Hamiltonian path that begins and
ends at the same vertex, then this type of
cycle will be known as a Hamiltonian circuit.

• In the connected graph, if there is a cycle with


all the vertices of the graph, this type of cycle
will be known as a Hamiltonian circuit.

• A closed Hamiltonian path will also be known


as a Hamiltonian circuit.
Hamiltonian Graph
Example 1: determine whether this graph contains a
Hamiltonian circuit.

Hamiltonian circuit = ABCEDA


Hamiltonian Graph
Example 2: determine whether this graph contains a
Hamiltonian circuit.

Hamiltonian circuit = ???


Hamiltonian Graph
Important points to note

 Ifany graph has a Hamiltonian circuit, then it will also


have the Hamiltonian path. But the vice versa in this
case will not be possible.

 A graphcan contain more than one Hamiltonian path


and Hamiltonian circuit.
Hamiltonian Graph
 Example 1: determine whether this graph is a
Hamiltonian graph.

Hamiltonian graph = ???


Hamiltonian Graph
 Example 2: determine whether this graph is a
Hamiltonian graph

Hamiltonian graph = ???


Hamiltonian Graph
 Example 3: determine whether this graph is a
Hamiltonian graph.

Hamiltonian graph = ???


Hamiltonian Graph
Example 4: determine whether this graph is a Hamiltonian
graph.

Hamiltonian graph = ???


Euler Graph
If all the vertices of any connected graph
have an even degree, then this type of
graph will be known as the Euler graph.

 In other words, we can say that an Euler


graph is a type of connected graph which
have the Euler circuit.
Euler Graph
Euler Path
If there is a connected graph with a path that
has all the edges of the graph, then that type of
path will be known as the Euler path.

If there is a connected graph, which has a path


that passes through each and every edge of the
graph only once, then that type of path will be
known as the Euler path.

We can also call the Euler path as Euler walk or


Euler Trail.
Euler Graph
Example 1: determine whether this graph contains an
Euler path.

Euler path = DABDCB


Euler Graph
Example 2: determine whether this graph contains an
Euler path.

Euler path = DABEDFBCD


Euler Graph
Euler Circuit
 If there is a connected graph with a circuit that has all the edges
of the graph, then that type of circuit will be known as the Euler
circuit.

 If there is a connected graph, which has a walk that passes


through each and every edge of the graph only once, then that
type of walk will be known as the Euler circuit. In this walk, the
starting vertex and ending vertex must be the same, and this
walk can contain the repeated vertex, but it is not compulsory.

 If an Euler trail contains the same vertex at the start and end of
the trail, then that type of trail will be known as the Euler
Circuit.

 A closed Euler trail will be known as the Euler Circuit.


Euler Graph
Example 1: determine whether this graph contains an
Euler circuit.

Euler circuit = ???


Euler Graph
Example 2: determine whether this graph contains an
Euler circuit.

Euler circuit = DABEDFBCD


Euler Graph
Semi Euler Graph
If there is a connected graph that does not
have an Euler circuit, but it has an Euler
path, then that type of graph will be known
as the semi-Euler graph.
Any graph will be known as semi Euler
graph if it satisfies two conditions, which
are described as follows:
For this, the graph must be connected
This graph must contain an Euler path
Euler Graph
Example 1: determine whether this graph is a semi
Euler graph

Semi Euler Graph = Yes


Euler Graph
Important Notes
 If there is a connected graph with an Euler circuit,
then that type of graph will be an Euler graph.

 If there is an even degree for all the vertices of the


graph, then that type of graph will be an Euler graph.

 If there is an Euler graph, then that graph will surely


be a Semi Euler graph.

 But it is not compulsory that a semi-Euler graph is


also an Euler graph.
Euler Graph
Example 1: determine whether this graph is an Euler
graph

Euler graph = EADFABCDE


Euler Graph
 Example 2: determine whether this graph is an Euler
graph

Euler graph = ???


Euler Graph
Other important notes
Checking for Euler circuit:
We will check whether all the vertices of a graph
have an even degree.
If it contains an even degree, then the graph
contains an Euler circuit. Otherwise, it will not be
an Euler circuit.
 Checking for Semi Euler graph:
We will check whether there is a connected graph
that has an Euler path.
If it is a connected graph and it has an Euler path,
then that type of graph will be a Semi Euler Graph.
Otherwise, it will not be a Semi Euler graph.
Euler Graph
Checking for Euler trail:
We will check whether more than two vertices of
the graph contain the odd degree.
If more than two vertices contain an odd degree,
then that type of graph may have an Euler Trail.
Otherwise, it will not have an Euler trail.
If there is a connected graph, which contains an
Euler circuit, then that graph will also contain an
Euler trail.
If there is a connected graph, which contains an
Euler trail, then that graph may or may not have
an Euler circuit.

You might also like