Introduction

Advanced Topics in Graph Theory

Dr. Muhammad Hussain

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

What is a Graph?

Graph theory is an old subject with many modern applications. Its

basic ideas were introduced in the eighteenth century by the great
Swiss mathematician Leonhaed Euler. He used graph to solve the
famous Konigsberg bridge problem.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

The Konigsberg Bridge Problem

The Seven Bridges of Knigsberg is a historically notable problem in

mathematics. Its negative resolution by Leonhard Euler in 1735
laid the foundations of graph theory and prefigured the idea of
topology.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

The Konigsberg Bridge Problem

The Seven Bridges of Knigsberg is a historically notable problem in

mathematics. Its negative resolution by Leonhard Euler in 1735
laid the foundations of graph theory and prefigured the idea of
topology.
The city of Knigsberg in Prussia (now Kaliningrad, Russia) was set
on both sides of the Pregel River, and included two large islands
which were connected to each other and the mainland by seven
bridges. The problem was to find a walk through the city that
would cross each bridge once and only once.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

The Konigsberg Bridge Problem

The Seven Bridges of Knigsberg is a historically notable problem in

mathematics. Its negative resolution by Leonhard Euler in 1735
laid the foundations of graph theory and prefigured the idea of
topology.
The city of Knigsberg in Prussia (now Kaliningrad, Russia) was set
on both sides of the Pregel River, and included two large islands
which were connected to each other and the mainland by seven
bridges. The problem was to find a walk through the city that
would cross each bridge once and only once.
The islands could not be reached by any route other than the
bridges, and every bridge must have been crossed completely every
time; one could not walk halfway onto the bridge and then turn
around and later cross the other half from the other side.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

The Konigsberg Bridge Problem

The walk need not start and end at the same spot. Euler proved
that the problem has no solution. There could be no non-retracing
the bridges.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

The Konigsberg Bridge Problem

The walk need not start and end at the same spot. Euler proved
that the problem has no solution. There could be no non-retracing
the bridges.
The difficulty was the development of a technique of analysis and
of subsequent tests that established this assertion with
mathematical rigor.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

The Konigsberg Bridge Problem

First, Euler pointed out that the choice of route inside each land
mass is irrelevant. The only important feature of a route is the
sequence of bridges crossed. This allowed him to reformulate the
problem in abstract terms (laying the foundations of graph theory),
eliminating all features except the list of land masses and the
bridges connecting them.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

The Konigsberg Bridge Problem

First, Euler pointed out that the choice of route inside each land
mass is irrelevant. The only important feature of a route is the
sequence of bridges crossed. This allowed him to reformulate the
problem in abstract terms (laying the foundations of graph theory),
eliminating all features except the list of land masses and the
bridges connecting them.
In modern terms, one replaces each land mass with an abstract
”vertex” or node, and each bridge with an abstract connection, an
”edge”, which only serves to record which pair of vertices (land
masses) is connected by that bridge. The resulting mathematical
structure is called a graph.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Importance of Graph Theory

Graphs are used to solve problems in many fields as

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Importance of Graph Theory

Graphs are used to solve problems in many fields as
To find the shortest path between two cities in a
transportation network.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Importance of Graph Theory

Graphs are used to solve problems in many fields as
To find the shortest path between two cities in a
transportation network.
To schedule exams of different classes in a university.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Importance of Graph Theory

Graphs are used to solve problems in many fields as
To find the shortest path between two cities in a
transportation network.
To schedule exams of different classes in a university.
To determine whether two computers are connected by a
communication link.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Importance of Graph Theory

Graphs are used to solve problems in many fields as
To find the shortest path between two cities in a
transportation network.
To schedule exams of different classes in a university.
To determine whether two computers are connected by a
communication link.
To see the different of flights between two cities in an airline
network.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Importance of Graph Theory

Graphs are used to solve problems in many fields as
To find the shortest path between two cities in a
transportation network.
To schedule exams of different classes in a university.
To determine whether two computers are connected by a
communication link.
To see the different of flights between two cities in an airline
network.
To represent the outcome of tournaments.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Importance of Graph Theory

Graphs are used to solve problems in many fields as
To find the shortest path between two cities in a
transportation network.
To schedule exams of different classes in a university.
To determine whether two computers are connected by a
communication link.
To see the different of flights between two cities in an airline
network.
To represent the outcome of tournaments.
To determine whether it is possible to walk down all the
streets in a city without going down a street twice.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Importance of Graph Theory

Graphs are used to solve problems in many fields as
To find the shortest path between two cities in a
transportation network.
To schedule exams of different classes in a university.
To determine whether two computers are connected by a
communication link.
To see the different of flights between two cities in an airline
network.
To represent the outcome of tournaments.
To determine whether it is possible to walk down all the
streets in a city without going down a street twice.
To find the number of colors needed to color the regions of a
map.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Importance of Graph Theory

Graphs are used to solve problems in many fields as
To find the shortest path between two cities in a
transportation network.
To schedule exams of different classes in a university.
To determine whether two computers are connected by a
communication link.
To see the different of flights between two cities in an airline
network.
To represent the outcome of tournaments.
To determine whether it is possible to walk down all the
streets in a city without going down a street twice.
To find the number of colors needed to color the regions of a
map.
To assign different channels to a television station.
Dr. Muhammad Hussain Advanced Topics in Graph Theory
 Introduction

Graph, Order and Size of Graph

Definition
A Graph G is a triple consisting of vertex set V (G ), an edge set
E (G ), and a relation that associates with each edge two
vertices(not necessarily distinct)called end points.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Graph, Order and Size of Graph

Definition
A Graph G is a triple consisting of vertex set V (G ), an edge set
E (G ), and a relation that associates with each edge two
vertices(not necessarily distinct)called end points.

Definition
Let G = (V (G ), E (G )) be a graph with V (G ) as set of vertices
and E (G ) as set of edges then |V (G )| is called the Order of G .

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Graph, Order and Size of Graph

Definition
A Graph G is a triple consisting of vertex set V (G ), an edge set
E (G ), and a relation that associates with each edge two
vertices(not necessarily distinct)called end points.

Definition
Let G = (V (G ), E (G )) be a graph with V (G ) as set of vertices
and E (G ) as set of edges then |V (G )| is called the Order of G .

Definition
Let G = (V (G ), E (G )) be a graph with V (G ) as set of vertices
and E (G ) as set of edges |E (G )| is called the Size of G .

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Vertex

Definition
A vertex of the graph G which is not the end of any edge is called
isolated vertex

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Vertex

Definition
A vertex of the graph G which is not the end of any edge is called
isolated vertex

Definition
Two vertices which are joined by an edge are said to be neighbors
or adjacent vertices of each other.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Vertex

Definition
A vertex of degree one is called a pendant vertex or a end vertex.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Vertex

Definition
A vertex of degree one is called a pendant vertex or a end vertex.

Definition
A vertex of a graph is called even vertex if its degree is even.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Vertex

Definition
A vertex of degree one is called a pendant vertex or a end vertex.

Definition
A vertex of a graph is called even vertex if its degree is even.

Definition
A vertex of a graph is called odd vertex if its degree is odd.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of edge

Definition
An edge having two coincident vertices is called a loop.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of edge

Definition
An edge having two coincident vertices is called a loop.

Definition
If two or more edges of the graph have the same end vertices then
these edges are called parallel edges.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of edge

Definition
An edge having two coincident vertices is called a loop.

Definition
If two or more edges of the graph have the same end vertices then
these edges are called parallel edges.

Definition
Two non parallel edges are said to be adjacent edges if they are
incident on a common vertex.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Remarks

Definition
The number of edges incident on a vertex with self loops counted
twice is called degree of vertex.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Remarks

Definition
The number of edges incident on a vertex with self loops counted
twice is called degree of vertex.

Definition
Let x be a fixed vertex of the graph G then the set of all neighbors
of x is called neighborhood set of x and it is denoted by N(x).

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
A simple graph is a graph having no loops and multiple edges.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
A simple graph is a graph having no loops and multiple edges.

Definition
A graph is finite if its vertex set and edge set are finite.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
A simple graph is a graph having no loops and multiple edges.

Definition
A graph is finite if its vertex set and edge set are finite.

Definition
A graph which is not finite is called infinite graph.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
A simple graph is a graph having no loops and multiple edges.

Definition
A graph is finite if its vertex set and edge set are finite.

Definition
A graph which is not finite is called infinite graph.

Definition
The null graph is the graph whose vertex set and edge set are
empty.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
If for some positive integer k, d(v ) = k for every vertex v of the
graph G is called k-Regular graph.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
If for some positive integer k, d(v ) = k for every vertex v of the
graph G is called k-Regular graph.

Definition
A graph which is not regular is called irregular graph.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
If for some positive integer k, d(v ) = k for every vertex v of the
graph G is called k-Regular graph.

Definition
A graph which is not regular is called irregular graph.

Definition
A simple graph in which each pair of distinct vertices is directly
joined by an edge is called complete graph. It is denoted by Kn ,
where n is order of the graph.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
A graph which is not simple is called multi graph.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
A graph which is not simple is called multi graph.

Definition
A graph G is said to be embedded in a surface S, when it is drawn
on S so that no two edges of G intersect.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
A graph G is said to be planer graph if it can be embedded in the
plane.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
A graph G is said to be planer graph if it can be embedded in the
plane.

Definition
A graph G which can not be embedded in the plane is called
non-planer graph.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
A graph G is said to be planer graph if it can be embedded in the
plane.

Definition
A graph G which can not be embedded in the plane is called
non-planer graph.

Definition
A graph G is called connected graph if there is a path connecting
each pair of vertices in G .

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
A graph G is said to be planer graph if it can be embedded in the
plane.

Definition
A graph G which can not be embedded in the plane is called
non-planer graph.

Definition
A graph G is called connected graph if there is a path connecting
each pair of vertices in G .

Definition
A graph which is not connected is called disconnected graph.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
A graph which has no cycle is called acyclic graph.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
A graph which has no cycle is called acyclic graph.

Definition
A connected acyclic graph is called tree graph. In the tree graph if
|V | = n then |E | = n − 1 and there is exactly one path between
every pair of vertices. Each edge of the tree graph is called branch
and each pendant vertex of the tree graph is called leave.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
A graph G (X , Y , E ) = Bn,m is bipartite graph having two vertex
sets X , Y and there will be edge between vertices of X and
vertices of Y . No edge will exists between vertices of X and
vertices of Y itself.

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Kinds of Graph

Definition
A graph G (X , Y , E ) = Bn,m is bipartite graph having two vertex
sets X , Y and there will be edge between vertices of X and
vertices of Y . No edge will exists between vertices of X and
vertices of Y itself.

Definition
A bipartite graph Bn,m is called complete bipartite if all vertices of
X will be adjacent to all vertices of Y . Complete bipartite graph is
denoted by Kn,m .

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Handshaking Lemma

Lemma
In a graph G sum of degree of each vertex is twice the number of
edges in a graph.
Xn
d(vi ) = 2|E (G )|
i=1

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Handshaking Lemma

Lemma
In a graph G sum of degree of each vertex is twice the number of
edges in a graph.
Xn
d(vi ) = 2|E (G )|
i=1

Proof:
Since every edge contributes 2 in the degree of graph so
n
X
2 + 2 + ... + 2 = d(vi )
i=1

n
X
d(vi ) = 2|E (G )|
i=1

Dr. Muhammad Hussain Advanced Topics in Graph Theory

 Introduction

Practice Exercises

Exercises:
Using the handshaking lemma to prove that, in any graph, the
number of vertices of odd degree is even.
nr
Prove that r −regular graph having n vertices has 2 edges.
Find number of edges in Kn .
Find number of edges in Kn,m .
Is there exist a simple graph with 12 vertices and 28 edges in
which the degree of each vertex is either 3 or 4.
Is there exist a simple graph such that three vertices have
degree 3 and one have degree 1.

Dr. Muhammad Hussain Advanced Topics in Graph Theory