Professional Documents
Culture Documents
Graph Theory and Algorithms: Pratima Panigrahi Department of Mathematics Indian Institute of Technology Kharagpur 721302
Graph Theory and Algorithms: Pratima Panigrahi Department of Mathematics Indian Institute of Technology Kharagpur 721302
Graph Theory and Algorithms: Pratima Panigrahi Department of Mathematics Indian Institute of Technology Kharagpur 721302
Pratima Panigrahi
Department of Mathematics
Indian Institute of Technology
Kharagpur 721302
p. 1/2
QUESTIONS:
(6) There are m jobs and n people, n m, but not all are
qualified for all the jobs. Is it possible to fill up all the jobs
by qualified people?
p. 3/2
(7) Is it possible to color the map of any country using at the
most four colors such that states having common boundaries
do not get the same color ?
p. 5/2
After Euler for about 100 years not much developments
were there in graph theory.
In 1847, G. R. Kirchhoff developed the theory of trees to
apply in electrical networks.
About ten years after Kirchhoff, Cayley also developed
theory of trees independently, to count isomers of saturated
hydrocarbons.
After that people like Hamilton, Mobius and others have
done some work.
p. 6/2
The subject has started seriously and systematically only
after 1920.
Within last 4-5 decades the subject has developed a lot.
Now Graph theory is one of the fast growing subjects
because of its applicability in various areas.
p. 7/2
Reference Books:
1. Introduction to graph theory, Douglas B. West.
p. 8/2
DEFINITION: An undirected graph (or simply a graph) G
is a pair (V, E) such that V is a nonempty set and E is a multi-set
of 1-subsets or 2-subsets of V .
p. 9/2
Elements of V are called vertices of G. Sometime vertex set
of G is denoted by V (G).
Elements of E are called edges of G. Sometime edge set of
G is denoted by E(G).
If l = {x, y} is an edge then x and y are called adjacent ,
otherwise non-adjacent .
If l = {x, y} is an edge then x and y are also called
neighbor of each other, otherwise non-neighbor .
Edge l = {x, y} is called incident on vertices x and y. And
x and y are called end on vertices of l.
p. 10/2
An edge of the form {x, x} = {x} is called a self loop or
simply a loop.
If an edge appears more than once then it is called a parallel
edge or a multiple edge.
p. 11/2
DEFINITION: An undirected graph free from self loops and
having no multiple edges is called a simple graph.
p. 12/2
DEFINITION: Degree of a vertex x, denoted by deg(x) or
degx or d(x), is the number of edges incident on x where loops
are counted twice.
In every graph G
X
degx = 2e
xV (G)
p. 14/2
DEFINITION: A graph H is called a subgraph of graph G
if V (H) V (G) and E(H) E(G).
p. 15/2
DEFINITION: A clique in a graph is a set of pairwise ad-
jacent vertices. In other words an induced subgraph which is a
complete graph is a clique in the graph.
p. 16/2
DEFINITION: For vertices u and v (not necessarily dis-
tinct) in graph G, a u-v walk W in G is an alternating sequence
W : u = v0 e1 v1 e2 v2 . . . ek vk = v of vertices and edges,
starting at u and ending at v such that every edge is incident on
vertices preceding and following it, ei = {vi1 , vi }, 1 i k. If
u = v then the walk is called a closed walk, otherwise an open
walk.The number k is called the length of the walk. In other
words length of a walk is the number edges (with counting multi-
plicity) appear in the walk.
p. 17/2
DEFINITION: A trail is a walk where no edge repeats, that
is, all the edges are distinct (vertices may repeat).
p. 18/2