Scribd
Upload
122 views9 pages

Definition A Graph Is A Set of Points, Called Nodes or Vertices, Which Are Interconnected

The chromatic number of the complete bipartite graph K3,4 is 2. Since it is a complete bipartite graph, it can be colored with only 2 colors - one for each partite set.

Uploaded by

TADESSE JENBERE
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
122 views9 pages

Definition A Graph Is A Set of Points, Called Nodes or Vertices, Which Are Interconnected

The chromatic number of the complete bipartite graph K3,4 is 2. Since it is a complete bipartite graph, it can be colored with only 2 colors - one for each partite set.

Uploaded by

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

Introduction

Definition − A graph is a set of points, called nodes or vertices, which are interconnected
by a set of lines called edges.
A graph (denoted as G = (V, E)) consists of a non-empty set of vertices or nodes V and a set
of edges E. A vertex a  represents an endpoint of an edge. An edge joins two vertices a, b 
and is represented by set of vertices it connects.
Example − Let us consider, a Graph is G = (V, E) where V = {a, b, c, d} and E = {{a, b}, {a, c},
{b, c}, {c, d}}
Here V is vertex and a, b, c, d are various vertex of the graph.
Here E represents edges and {a, b}, {a, c}, {b, c}, {c, d} are various edge of the graph.
Adjacency

Here are the norms of adjacency −


 In a graph, two vertices are said to be adjacent, if there is an edge
between the two vertices. Here, the adjacency of vertices is maintained
by the single edge that is connecting those two vertices.
 In a graph, two edges are said to be adjacent, if there is a common vertex
between the two edges. Here, the adjacency of edges is maintained by the
single vertex that is connecting two edges.
Example 1

In the above graph −


 ‘a’ and ‘b’ are the adjacent vertices, as there is a common edge ‘ab’ between them.
 ‘a’ and ‘d’ are the adjacent vertices, as there is a common edge ‘ad’ between them.
 ‘ab’ and ‘be’ are the adjacent edges, as there is a common vertex ‘b’ between them.
 ‘be’ and ‘de’ are the adjacent edges, as there is a common vertex ‘e’ between them
Graph Coloring
• Graph coloring is the way of labelling graph components such as vertices,
edges, and regions under some constraints. In a graph, no two adjacent
vertices, adjacent edges, or adjacent regions are colored with minimum
number of colors. This number is called the chromatic number and the graph is
called a properly colored graph.
• Vertex coloring − A way of coloring the vertices of a graph so that no two
adjacent vertices share the same color.
• Edge Coloring − It is the method of assigning a color to each edge so that no
two adjacent edges have the same color.
• Face(region) coloring − It assigns a color to each face or region of a planar
graph so that no two faces that share a common boundary have the same color.
Region coloring
Example
• Take a look at the following graph. The regions ‘aeb’ and ‘befc’ are
adjacent, as there is a common edge ‘be’ between those two regions.
Similarly the other regions are also coloured based on the adjacency. This
graph is coloured as follows −
Vertex coloring
Given a planar or non-planar graph , if we assign colors to its vertices in
such a way that no two adjacent vertices have the same color ,then we
can say that the graph G is properly colored.
Proper coloring of a graph means assigning colors to its vertices such
that adjacent vertices have different colors.
Example: B A
A B 2-colorable graph

G1
D C
P D C
P
3-colorable graph
G2
Q R
Q R
G3 1 2 1 2
2-colorable graph

666 3 6 3

5 4 5 4
Chromatic Number
Chromatic number is the minimum number of colors
required to color a graph. For example, the chromatic
number of the following graph is 3.

We cannot use the same color for any adjacent vertices.


Chromatic number(cont…)
The minimum number of colors required to color all the vertices of a given
graph is called a chromatic number of a given graph.
Example: A B
SO,the minimum number of colors of
the given graph m is 4.

D C

If the degree of the given graph is ‘d’,then it can be colored with ‘d+1’
colors.
Example:the above graph are degree 3,then the color of that graph is 4.
The chromatic number of a graph G is usually denoted by X(G).
A Graph G is said to be k-colourable , if we can properly color it with k colors.
Example: find the chromatic number of the following graph?

101 1
10 0
graph

2 5 2 5
9 6 9 So,the chromatic number of this graph is-
6
X(Petersen graph)=3
s en

8 7 8 7
Peter

3 4 3

Exercise:find chromatic number this graph(complete bipartite graph


a
k3,4) b c

d e f g

You might also like