04 - Bipartite Graphs
04 - Bipartite Graphs
Graph Theory
Bipartite graphs
A Senthil Thilak
Preliminaries
Outline
1 Bipartite Graphs
Preliminaries
Bipartite graphs - Definition and examples
Characterization of bipartite graphs
Complete bipartite graphs
Preliminaries
Distance in graphs
Definition (Distance between two vertices)
Let u and v be two vertices of G . If u and v are in the same
component of G , then the distance between u and v , denoted
by dG (u, v) (or simply by d(u, v)) is the length of a shortest
u, v -path in G ; otherwise we define d(u, v ) to be ∞.
Example
In the graph given above, notice that the following are u, y -paths:
Preliminaries
Distance in graphs
Definition (Distance between two vertices)
Let u and v be two vertices of G . If u and v are in the same
component of G , then the distance between u and v , denoted
by dG (u, v) (or simply by d(u, v)) is the length of a shortest
u, v -path in G ; otherwise we define d(u, v ) to be ∞.
Example
In the graph given above, notice that the following are u, y -paths:
P 0 = (u, v , y ) P 00 = (u, w , v , y ) P 000 = (u, v , w , x, y )
Preliminaries
Distance in graphs
Definition (Distance between two vertices)
Let u and v be two vertices of G . If u and v are in the same
component of G , then the distance between u and v , denoted
by dG (u, v) (or simply by d(u, v)) is the length of a shortest
u, v -path in G ; otherwise we define d(u, v ) to be ∞.
Example
In the graph given above, notice that the following are u, y -paths:
P 0 = (u, v , y ) P 00 = (u, w , v , y ) P 000 = (u, v , w , x, y )
0
Here, P is a shortest u, y -path and is of length 2. Therefore,
Preliminaries
Distance in graphs
Definition (Distance between two vertices)
Let u and v be two vertices of G . If u and v are in the same
component of G , then the distance between u and v , denoted
by dG (u, v) (or simply by d(u, v)) is the length of a shortest
u, v -path in G ; otherwise we define d(u, v ) to be ∞.
Example
In the graph given above, notice that the following are u, y -paths:
P 0 = (u, v , y ) P 00 = (u, w , v , y ) P 000 = (u, v , w , x, y )
0
Here, P is a shortest u, y -path and is of length 2. Therefore,
d(u, y) = 2.
Graph Theory A Senthil Thilak
Bipartite Graphs
Preliminaries
Preliminaries
Preliminaries
Example
Outline
1 Bipartite Graphs
Preliminaries
Bipartite graphs - Definition and examples
Characterization of bipartite graphs
Complete bipartite graphs
(a) Graph G
(a) Graph G
(c) Graph H
Figure: Examples of bipartite graphs
(b) A bipartition of G
(a) Graph G
(c) Graph H
Figure: Examples of bipartite graphs
(b) A bipartition of G
(a) Graph G
Outline
1 Bipartite Graphs
Preliminaries
Bipartite graphs - Definition and examples
Characterization of bipartite graphs
Complete bipartite graphs
Proof contd...
Let P be a shortest (u, w )-path of length p and Q be a shortest (u, v )-path of length q. (Refer figure
below)
16 1 Basic Results
v
P
u w1
Q
w
Proof contd...
Let P be a shortest (u, w )-path of length p and Q be a shortest (u, v )-path of length q. (Refer figure
below)
16 1 Basic Results
v
P
u w1
Q
w
Proof contd...
Let P be a shortest (u, w )-path of length p and Q be a shortest (u, v )-path of length q. (Refer figure
below)
16 1 Basic Results
v
P
u w1
Q
w
Proof contd...
Let P be a shortest (u, w )-path of length p and Q be a shortest (u, v )-path of length q. (Refer figure
below)
16 1 Basic Results
v
P
u w1
Q
w
Proof contd...
Let P be a shortest (u, w )-path of length p and Q be a shortest (u, v )-path of length q. (Refer figure
below)
16 1 Basic Results
v
P
u w1
Q
w
Outline
1 Bipartite Graphs
Preliminaries
Bipartite graphs - Definition and examples
Characterization of bipartite graphs
Complete bipartite graphs
Thank You!!!