Lecture 1--Graph Algorithms -- Basics.pptx

Graph Theory - History
Leonhard Euler's paper on
“Seven Bridges of
Königsberg” ,
published in 1736.

Famous problems
• “The traveling salesman problem”
– A traveling salesman is to visit a number of cities; how to plan
the trip so every city is visited once and just once and the whole
trip is as short as possible ?

Famous problems
In 1852 Francis Guthrie posed the “four color
problem” which asks if it is possible to color, using
only four colors, any map of countries in such a
way as to prevent two bordering countries from
having the same color.
This problem, which was only solved a century later
in 1976 by Kenneth Appel and Wolfgang Haken,
can be considered the birth of graph theory.

Examples
• Cost of wiring electronic components
• Shortest route between two cities.
• Shortest distance between all pairs of cities in
a road atlas.
• Matching / Resource Allocation
• Task scheduling
• Visibility / Coverage

Examples
• Flow of material
– liquid flowing through pipes
– current through electrical networks
– information through communication networks
– parts through an assembly line
• In Operating systems to model resource handling
(deadlock problems)
• In compilers for parsing and optimizing the code.

Graph Definitions and Notation
4
2
5
1
4
2
6
6
1 3
5
3

Definitions
• Vertex
– Basic Element
– Drawn as a node or a dot.
– Vertex set of G is usually denoted by V(G), or V
• Edge
– A set of two elements
– Drawn as a line connecting two vertices, called
end vertices, or endpoints.
– The edge set of G is usually denoted by E(G), or E.

• Let G=(V,E, g) be a graph and e be an edge of this
graph.
• Then there are vertices v and w such that
g(e)={v,w}; vertices v and w are end vertices of e
• When a vertex v is an end point of some edge e, we
say that e is an incident with the vertex v and v is
incident with the edge e.
• Two vertices v and w of G are said to be adjacent if
there exists an edge e ∈ E such that g(e)={v,w}.

• If e is an edge such that g(e) = {v,w}, where
v=w, then e is an edge from the vertex v to
itself. Such an edge is called a loop on the
vertex v or at the vertex v.
• If there is a loop on v, then v is adjacent to
itself.

v3
e1
v1 v2
v4
v6
e2
e3
e5 e4
e6 e7
v5
v7

• Let G=(V, E, g) be a graph.
• The incidence function g need not be one – to – one.
• Therefore, there may exist edges e1, e2, …., en-1, en,
n ≥ 2 such that g(e1)= g(e2) = …… = g(en) = {v, w}.
• Such edges are called parallel edges.
Example:
g(e1)=g(e2)={v1, v2}. So edges e1 and e2 are parallel. Similarly
edges e4, e6 and e7 are parallel.
e1
v1 v2
v4
v6
e2
e3
e5 e4
e6 e7
v5
v7

DEFINITION :: Isolated vertex
DEFINITION :: Degree of a vertex
• Let G be a graph and v be a vertex in G. We say that v is an
isolated vertex if it is not incident with any edge.
• Let G be a graph and v be a vertex of G. The degree of v,
written as deg(v) or d(v) is the number of edges incident
with v.
• We make the convention that each loop on a vertex v
contributes 2 to the degree of v.
Example:
v5
deg(v1)=2
deg (v2)= 1
deg (v3)=3
deg(v4)=2
deg(v5)=0
v1
v4 v3
e1
e3
e2
v2

DEFINITION:: k-regular graph
• Let G be graph and k be a nonnegative integer.
• G is called a k-regular graph if the degree of each
vertex of G is k
Example:
• An interesting k-regular graph is the Petersen 3-
regular graphs follows: v1
v2 v3
v10 v7
v6
v9 v8
v4
v5

DEFINITION :: Even (odd ) degree vertex
• Let G be a graph and v be a vertex in G.
• v is called an even (odd) vertex if the degree of
v is even (odd)
Example::
deg(v1)=2 Even
deg (v2)= 1 Odd
deg (v3)=3 Odd
deg(v4)=2 Even
v1
v4 v3
e1
e3
e2
v2

DEFINITION :: Degree Sequence
• Let n1, n2, n3, …, nk be the degrees of vertices of a graph G such
that n1 ≤ n2 ≤ n3 ≤ … ≤ nk.
• Then the finite sequence n1, n2, n3, …, nk is called the degree
sequence of the graph
• Every graph has a unique degree sequence.
• However, we can construct completely different graphs having
same degree sequence.
Example::
• The degree sequence of both of these graphs is 2, 3, 3, 4. But
the graphs are different.
v1 v2
v3
v4
v1
v4 v3
v2

Some Theorems
• Theorem 1: Euler: The sum of the degrees of
all vertices of a graph is twice the number of
edges.
• Corollary: The sum of the degrees of all the
vertices of a graph is an even integer.
• Corollary: In a graph the number of odd
degree vertices is even.

DEFINITION :: Simple graph
A graph is called a simple graph if G does not contain any parallel
edges and any loop
b
d
e
c
a

DEFINITION :: Complete Graph
A simple graph with n vertices in which there is an edge
between every pair of distinct vertices is called a complete
graph on n vertices. This is denoted as Kn.
Theorem: The number of edges in a complete graph with n
vertices is n(n-1)/2
b
d
e
a
c
K5
Example:

DEFINITION :: Subgraph
Let G= (V, E, g) be a graph. A triple G1=(V1, E1, g1) is called a
subgraph of G if V1 is nonempty subset of V, E1 is a subset of E,
and g1is the restriction of g to E1 such that for all e∈ E1, if g1(e)=
g(e) = {u, v}, then u,v∈V1.
v1
v2
v3
v4
v5
v6
e1
e3
e4
e6
e7
e5
e2
v3
v2
v1 v4
v5
e1 e4
e2
v2
v1 v4
v5
v6
e1
e6 e5
e2
v2
v1
v3
v4
e1
e3
e2
G G1 G2 G3

Sub-graph
• Few observations:
– Every graph is its own sub-graph
– A sub-graph of a sub-graph of G is a sub-graph of
G
– A single vertex in a graph G is a sub-graph of G
– A single edge in G, together with its vertices, is
also a sub-graph of G

DEFINITION :: Induced Subgraph
H is an induced subgraph of G on S, where S is
subset of V(G); then V(H) =S and E(H) is the
set of edges of G such that both the end points
belong to S.
v2
v3
v4
v5
v6
e1
e3
e4
e6
e7
e5
e2
v1 v4
v5
e1
e6 e5
e2
v1 v4
v5
e1
e6
e2
Subgraph S Induced Subgraph H

DEFINITION :: Bipartite Graph
A simple graph G is called a bipartite graph if the vertex set V of G
can be partitioned into Nonempty subsets V1 and V2 such that each
edge of G is incident with one vertex in V1 and one vertex in V2.
V1∪ V2 is called a bipartition of G.
A
B
C
D
X
Y
Z

25
Bipartite Graphs
Example I: Is C3 bipartite?
v1
v2 v3
No, because there is no way to partition
the vertices into two sets so that there are
no edges with both endpoints in the same
set.
Example II: Is C6 bipartite?
v5
v1
v2
v3 v4
v6
v1 v6
v2
v5
v3
v4
Yes, because we
can display C6
like this:

DEFINITION :: Complete Bipartite Graph
A bipartite graph G with bipartition V1∪V2 is called a complete
bipartite graph on m and n vertices if the subsets V1 and V2 contain
m and n vertices, respectively, such that there is an edge between
each pair of vertices v1 and v2, where v1∈V1and v2∈V2.
A complete bipartite graph on m and n vertices is denoted by Km,n
v1 v6
v2
v5
v3
v4

Isomorphism of Graphs
• Let G=(V,E) and G’={V’, E’} be graphs.
• G and G’ are said to be isomorphic if there
exist a pair of functions f:V  V’ and g: E
E’ that associates each element in V with
exactly one element in V’ and vice versa;
– g associates each element in E with exactly one
element in E’ and vice versa, and
– for each v∈ V, and each e ∈ E, if v is an end point
of the edge e, then f(v) is an endpoint of the edge
g(e).

• If two graphs are isomorphic then they must
have
– The same number of vertices
– The same number of edges
– The same degrees for corresponding vertices
– The same number odd connected components
– The same number of loops
– The same number of parallel edges.

Example:
• The vertices a, b, c, d, e in the graph (A) corresponds to v1, v2,
v3, v4 and v5 of the graph (B) respectively.
• The edges 1, 2, 3, 4, 5 and 6 correspond to e1, e2, e3, e4, e5 and
e6 respectively.
b
e
a
c
d
5
6
4 2
1
3
e1
e3
e2
e5
e6
e4
v1 v2
v3
v4
v5
A B
Except for the labels (i.e. names ) of their vertices and
edges, isomorphic graphs are the same graph.

Walks, Paths, and Cycles
DEFINITION :: Walk
• Let u and v be two vertices in a graph G.
• A walk from u to v, in G, is an alternating sequence of n+1 vertices and
n edges of G
(u= v1, e1, v2, e2, v3, e3, ….., vn-1, en-1, vn, en, vn+1=v)
beginning with vertex u, called the initial vertex, and ending with vertex
v, called the terminal vertex, in which vi and vi+1 are endpoints of edge ei for
i=1, 2, …., n.
Example:
Walks:
v1, b, v2, e, v3, h, v3, d, v4
v4, c, v2, f, v5 , g, v6
v1, b, v2, c, v4, a, v1
v1
v4 v3
v2 v5
v6
a
b
e
d
f
g
c
h

DEFINITION :: Directed walk
• Let u and v be two vertices in a directed graph G.
• A directed walk from u to v in G is an alternating sequence
of n+1 vertices and n arcs of G
(u= v1, e1, v2, e2, v3, e3, ….., vn-1, en-1, vn, en, vn+1=v)
beginning with vertex u and ending with vertex v in which
each edge ei, for i=1, 2, … , n, is an arc from vi to vi+1

DEFINITION :: Length of a walk (directed walk)
Open walk
Closed
walk

DEFINITION :: Trail and Path
Walks:
v1, b, v2, e, v3, h, v3, d, v4 ---- Not a path, trail
v4, c, v2, f, v5 , g, v6 ------ Path, trail
v1, b, v2, c, v4, a, v1 ----- Path (also closed path,
cycle), trail (circuit)
v1
v4 v3
v2 v5
v6
a
b
e
d
f
g
c
h
DEFINITION :: Cycle
DEFINITION :: Circuit

DEFINITION :: Trivial walk, path or trail
DEFINITION :: k-cycle

Operations on Graph
DEFINITION :: Complement of a simple graph

Operations on Graph
DEFINITION :: Difference operation
If the graphs G=(V, E) and G’=(V’, E’) are simple and V’⊆ V,
then the difference graph is G- G’ = (V, E’’) where E’’ contains
those edges from G that are not in G’ (simple graph).

Operations on Graph
DEFINITION ::Removal of a vertex
DEFINITION ::Removal of a edge
If e is an edge of the graph G = (V, E) then G – e is graph (V, E’) , where E’ is
obtained by removing e form E.
i.e. deletion of a vertex v means the deletion of the vertex v and deletion of
all the edges incident on v.

Connected graph
DEFINITION :: Connectedness
DEFINITION :: Connected Graph
For example, any two computers in a network can communicate if and
only if the graph of this network is connected.
Note: A graph consisting of only one vertex is always connected, because it does
not contain any pair of distinct vertices.

41
Connected graph
Example: Are the following graphs connected?
d
a
b
c
e
Yes.
d
a
b
c
e
No.
d
a
b
c
e
Yes.
d
a
b
c
e
f
No.

Some Theorem
Theorem:
A graph is disconnected if and only if its vertex set V can be partitioned into two
nonempty, disjoint subsets V1 and V2 such that there exists no edge in G whose one end
vertex is in subset V1 and the other in subset V2.
Proof:
Suppose that such a partition exists.
Consider two arbitrary vertices a and b of G, such that a ϵ V1 and b ϵ V2. No path can
exist between vertices a and b; otherwise there would be at least one edge whose one end
vertex would be in V1 and the other in V2. hence, if a partition exists, G is not connected.
Conversely, let G be a disconnected graph.
Consider a vertex a in G. Let V1 be the set of all vertices that are joined by paths to a.
Since G is disconnected V1 does not include all vertices of G. The remaining vertices will
form a (nonempty) set V2. So no vertex in V1 is joined to any in V2 by an edge. Hence the
partition.

Component
DEFINITION :: Component

Connected graph
Theorem: If a graph (connected or disconnected) has only two
odd vertices v1 and v2, then there is a path between v1 and v2.
Proof:
Case 1: G is connected. It is obvious that there is a path
between v1 and v2.
Case 2: G has two or more connected components. For each
of these connected components the theorem which states that
number of odd vertices in a graph is always even is applicable.
As there are only two odd vertices so, v1 and v2 must belong
to the same component. Otherwise the above stated theorem
would be violated. (Proved)

Vertex Cover
• A set S is a subset of V(G) is a vertex cover of G (of
the edges of G) if every edges of G is incident with a
vertex in S.
• A vertex cover of the minimum cardinality is called a
minimum vertex cover denoted as MVC(G)
Example:
Application: Art Gallery

Some more examples of vertex cover
wheel graph W8 K3,3 utility graph Petersen graph and Frucht graph

Vertex Cover
• What is the cardinality of MVC in the
complete graph Kn ?
• What about the complete bipartite graph Km,n?
• The cycle Cn, where n is even or odd?
• Kn it will be (n-1).
• Km,n it will be m<= n in two sets A and B, then m can be MVC
• Cn it will be n/2 (it it is even) and celing(n/2) if it is odd.

Vertex cover Algorithm
• APPROX-VERTEX_COVER (G: Graph)
• c ← { }
• E’ ← E[G]
• while E’ is not empty do
• Let (u, v) be an arbitrary edge of E’
• c ← c U {u, v}
• Remove from E’ every edge incident on either
u or v
• return c
Analysis
It is easy to see that the running time of this algorithm is O(V+E),
using adjacency list to represent E’.

Vertex cover : Example
APPROX-VERTEX-COVER algorithm returns a vertex-cover that is
atmost twice the size of an optimal cover.

Proof of the bound of the algorithm
• Theorem: APPROX-VERTEX-COVER is a
polynomial-time 2-approximate algorithm i.e.,
the algorithm has a ratio bound of 2.
• Goal: Since this a minimization problem, we
are interested in smallest possible c/c*.
Specifically we want to show c/c* ≤ 2 = p(n). In
other words, we want to show that APPROX-
VERTEX-COVER algorithm returns a vertex-
cover that is atmost twice the size of an optimal
cover.

Proof continued
• Proof: Let the set c and c* be the sets output by APPROX-VERTEX-COVER and
OPTIMAL-VERTEX-COVER respectively. Also, let A be the set of edges selected by line 4.
• Because, we have added both vertices, we get c = 2|A| but OPTIMAL-VERTEX-COVER
would have add one of two.
• => c/c* ≤ p(n) = 2.
• Formally, since no two edge in A are covered by the same vertex from c* (since, once an edge
is picked in line 4, all other edges that are incident on its endpoints are deleted from E` in line
6) and we the lower bound:
• |c*| ≥ A ---------------------------------- 1
• On the size of an OPTIMAL-VERTEX-COVER.
• In line 4, we picked both end points yielding an upper bound on the size of Vertex-Cover.
• |c| ≤ 2|A|
• Since, upper bound is an exact in this case, we have
• |c| = 2|A| ---------------------------------- 2
Take |c|/2 = |A| and put it in equation 1
|c*| ≥ |c|/2
|c*|/|c| ≥ 1/2
|c*|/|c| ≤ 2 = p(n)
• proving the theorem.

Independent Set
• Definition:
An independent set or stable set is a set of vertices in a
graph, no two of which are adjacent.
– That is, it is a set of l vertices such that for every two
vertices in l, there is no edge connecting the two.
– Equivalently, each edge in the graph has at most one
end point in l.
– The size of an independent set is the number of
vertices it contains.
• The cardinality of the biggest independent set in G is called
the independence number (or stability number) of G and is
denoted by α(G).

Example: Independent Set
What will be the values for α(Kn), α(Km,n) and α(Cn)??
α(Kn)=1, α(Km,n) =max (m,n) and α(Cn)=n/2 or (n-1)/2)

Independent Set
• An independent set is said to be
– maximal, if it is not a subset of any larger independent set;
– maximum, if there is no larger independent set in the graph.
I = {6, 9} is the maximal
independent set.
I= {1, 2, 5, 7, 8} is the
maximum independent set.

Independent Set Problem
• Given an undirected graph, find a maximum
cardinality independent set.
• The problem is NP-hard.
• IP formulation
• ∝ 𝐺 = 𝑚𝑎𝑥 𝑖=1
𝑛
𝑥𝑖
s.t.xi+ xj ≤ 1, ∀ (i , j) ∈ E,
xi∈ {0, 1}, i = 1, . . . , n.

Lecture 1--Graph Algorithms -- Basics.pptx

More Related Content

Similar to Lecture 1--Graph Algorithms -- Basics.pptx

Recently uploaded

Lecture 1--Graph Algorithms -- Basics.pptx