Scribd
Upload
39 views11 pages

s9.3 Graph Bipartite

A bipartite graph is a graph whose vertices can be divided into two disjoint sets such that every edge connects a vertex in one set to a vertex in the other set. A complete bipartite graph Km,n is a bipartite graph with its vertices partitioned into two sets of m and n vertices respectively, and there is an edge between every pair of vertices where one vertex is in the first set and the other in the second set. The document provides examples of determining if a graph is bipartite by coloring the vertices in two colors such that no two adjacent vertices have the same color, and defines complete bipartite graphs.

Uploaded by

Engineer JO
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
39 views11 pages

s9.3 Graph Bipartite

A bipartite graph is a graph whose vertices can be divided into two disjoint sets such that every edge connects a vertex in one set to a vertex in the other set. A complete bipartite graph Km,n is a bipartite graph with its vertices partitioned into two sets of m and n vertices respectively, and there is an edge between every pair of vertices where one vertex is in the first set and the other in the second set. The document provides examples of determining if a graph is bipartite by coloring the vertices in two colors such that no two adjacent vertices have the same color, and defines complete bipartite graphs.

Uploaded by

Engineer JO
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 11

Bipartite Graphs

Discrete Mathematics

Bipartite Graphs 1
Definition: Bipartite Graphs

Definition
A simple graph G is called bipartite if its vertex set V can be
partitioned into two disjoint sets V1 and V2 such that every edge
in the graph connects a vertex in V1 and a vertex in V2 (or, there
is no edge between vertices of subset V1 and between vertices of
subset V2 ).

v1 v2 v1
v2
v6 v3 v3
v4
v5
v6
v5 v4
V1 V2

Showing that C6 is bipartite


Bipartite Graphs 2
Is This Graph Bipartite?

f g

e
a

c b

Bipartite Graphs 3
Answer: Step 1 of 3

We label one vertex of the graph with the color blue. How to
choose this first vertex? Simply choose the first one in
lexicographic order.
f g

e
a

c b

Level 1 (Blue) : a

Bipartite Graphs 4
Answer: Step 2 of 3

The adjacent vertices b, f and g of the first vertex a must be of


the other color. We label them with the red color.
f g

e
a

c b

Level 1 (Blue) : a
Level 2 (Red) : b, f and g

Bipartite Graphs 5
Answer: Step 3 of 3

The adjacent vertices to b, f and g must be of the other color.


We label them with the blue color.
f g

e
a

c b

Level 1 (Blue) : a
Level 2 (Red) : b, f and g
Level 3 (Blue) : c, d and e
At the end of the process, if all the vertices have one unique label,
then the graph is bipartite.

Bipartite Graphs 6
Is This Graph Bipartite?

e f

d a

c b

Bipartite Graphs 7
Answer: Step 1 of 3

We label one vertex of the graph with the color blue. For this, we
choose the first vertex in lexicographic order.
e f

d a

c b

Level 1 (Blue) : a

Bipartite Graphs 8
Answer: Step 2 of 3

The adjacent vertices b, d and f of the first vertex a must be of


the other color. We label them with the red color.
e f

d a

c b

Level 1 (Blue) : a
Level 2 (Red) : b, d and f

Bipartite Graphs 9
Answer: Step 3 of 3

The adjacent vertices to vertices b, d and f must be of the other


color. We label them with the blue color.
e f

dd a

c b

Level 1 (Blue) : a
Level 2 (Red) : b, d and f
Level 2 (Red) : c, d ???
As soon as one vertex must have two different colors, the graph is
not bipartite.

Bipartite Graphs 10
Definition: Complete Bipartite Graph

Definition
The complete bipartite graph Km,n is the graph that has its
vertex set partitioned into two subsets of m and n vertices,
respectively. There is an edge between two vertices if and only if
one vertex is in the first subset and the other vertex in the second
subset.

K1,4 K2,3 K3,3 K3,5

Bipartite Graphs 11

You might also like