ABSTRACT

Coloring the vertices of a graph G subject to given conditions can be

considered as a random experiment and corresponding to this experiment, a
discrete random variable X can be defined as the color of a vertex chosen at
random, with respect to the given type of coloring of G and a probability mass
function for this random variable can be defined accordingly. A proper coloring
C of a graph G, which assigns colors to the vertices of G such that the number
of vertices in any two color classes differ by at most one, is called an equitable
coloring. In this project, we study two statistical parameters of wheel related
graphs, with respect to their equitable colorings.

1
 INTRODUCTION

In 1736, Leonhard Euler wrote a paper on the Seven Bridges of

Konigsberg which is regarded as the first paper in the history of graph
theory. Graph theory is now a major tool in mathematical research,
electrical engineering, computer programming and networking,
communication and so on.
Graph coloring is a special area in Graph theory. Graph coloring
was first noted in 1852 by a student of University College London,
Francis Guthrie (1831-1899), who, while coloring a map of the counties
of England, noticed that only four colors were needed to ensure that all
neighbouring country were allocated different colors.
Many types of vertex and edges coloring are used in Graph
coloring. Equitable coloring is one of the type of vertex coloring. Equitable
coloring of a graph is an assignment of colors to the vertices in such a way
that no two adjacent vertices have the same color and the number of
vertices in any two color classes differ by at most one.
Coloring of the vertices of a given graph G can be considered as a
random experiment. For a proper k-coloring C = c1, c2, c3, ..., ck of G,
define a random variable X which denotes color (the subscript i of the
color ci ) of any arbitrary vertex in G. As the sum of all weights of
colors of G is equal to the number of vertices of G, the real values
function f (i) defined by:

f (i) = ᶿ(c i)
|V (G)|; i=1,2,...,k
0; elsewhere
will be the probability mass function of the random variable X, where
θ(ci)=The cardinality of the color class of the color ci and

V (G) = The number of vertices in a graph G.

2
 CHAPTER II

2.1 EQUITABLE COLORING

An equitable coloring of a graph G is a proper coloring C of G which
an assignment of colors to the vertices of G such that the numbers of
vertices in any two color classes differ by at most one.
Example 2.1:

a b
c₁ a
c c₂
₁

e
d c
c₂ c₁ c₁

Fig 2.1 Equitable Coloring

Equitable coloring conjecture(ECC):

For any connected graph G, which is neither a complete graph nor
an odd cycle, χe(G) ≤ ∆(G) , where ∆(G) is the maximum vertex degree
in G.

Proof:
Let G be a k - chromatic graph, which satisfies the hypothesis of the
theorem. Without loss generality, assume that G is k - critical.
Every critical graph is a block. ∴ G is a block.
Also, one critical and two critical graphs are complete and three critical
graphs are odd cycle. So choose, k ≤ 4.
If G has a 2-vertex cut {u, v} then d(u) + d(v) = 3k − 5.

Since ∆ is maximum degree of a graph G

16
Since k is an integer and 2∆ is even. Then
∴k ≤∆

The theorem holds when G has 2-vertex cut.

Assume that G is 3-connected. Therefore G is not complete and there are
three vertices u, v, w such that uv, vw ∈
/ E and uv ∈
/ ESet u = v1, w =v2
and let v3, v4, ..., vv = v be any ordering of the vertices of G − u, w
such that each vi is adjacent to some vj with j > i.
Now describe a ∆ - coloring of G as follows:

Assign color 1 to v1 = u and v2 = w then successively color v3, v4, ...vv

each with the first available color in the list 1, 2, ..., ∆.
By the construction of the sequence v1, v2, ...vv each vertex vi is adjacent to
some vj ,j > i and therefore to at most ∆− 1 coloring to the vertices vj with
j > i when its turn comes to be colored vi is adjacent to at most ∆ − 1
colors and thus one of the colors 1, 2, ..., ∆ will be available.

Finally since vv is adjacent to two vertices of color 1 (namely v1 and v2),

it is adjacent to at most ∆ − 2 other colors and can be assigned one of
the colors 2, 3, ..., ∆.

Hence χ(G) ≤ ∆(G) when G is 3-connected.

Thus χ(G) ≤ ∆(G) if G is connected simple graph and is neither an odd

graph nor a complete graph.

By this way the theorem holds for equitable coloring, then χe(G) ≤ ∆(G).

17
Verification of Equitable Coloring Conjecture (ECC) with
some examples:
Graph:
c d g

a b e f

Fig 2.2 Graph

Vertex a b c d e f g
Color c1 c 2 c1 c2 c1 c2 c 1

Minimum number of colors required in the equitable coloring of the graph

are 2.

Equitable chromatic number, χe(G) = 2.

Maximum vertex degree, ∆(G) = 3.

∴ χe(G) ≤ ∆(G)

Planar Graph:
a b

c d
Fig 2.3 planar Graph

Vertex a b c d e
Color c1 c2 c₃ c₁ c3

18
Minimum number of colors required in the equitable coloring of the graph
are 3.

Equitable chromatic number, χe(G) = 3.

Maximum vertex degree, ∆(G) = 3.

∴ χe(G) ≤ ∆(G)

Bipartite Graph:
a b

c d e

Fig 1.5 Bipartite Graph

Vertex a b c d e
Color c1 c1 c2 c 2 c2

Minimum number of colors required in the equitable coloring of the graph

are 2.

Equitable chromatic number, χe(G) = 2.

Maximum vertex degree, ∆(G) = 3.

∴ χe(G) ≤ ∆(G)

19
Even Cycle:
a b

e
e3

e₃ v₃

d c

Fig 2.5 Even cycle

Vertex a b c d
Color c1 c2 c1 c2

Minimum number of colors required in the equitable coloring of the graph

are 2.
Equitable chromatic number, χe(G) = 2.
Maximum vertex degree, ∆(G) = 2.

∴ χe(G) ≤ ∆(G)

Tree:
b
a

c d e

Fig 2.6 Tree

Vertex a b c d e
Color c1 c1 c 2 c1 c2

20
Minimum number of colors required in the equitable coloring of the graph
are 2.

Equitable chromatic number, χe(G) = 2.

Maximum vertex degree, ∆(G) = 2.

∴ χe(G) ≤ ∆(G)

Star Graph:
a
f b

c
g

d
f e

Fig 2.7 Star Graph

Vertex a b c d e f g h i
Color c3 c2 c5 c4 c₄ c4 c5 c2 c1

Minimum number of colors required in the equitable coloring of the graph

are 5.

Equitable chromatic number, χe(G) = 5.

Maximum vertex degree,

∴ χe(G) ≤ ∆(G)

21
Complete Graph: a

e b

c
d

Fig 2.8 Complete Graph

Vertex a b c d e
Color c1 c2 c3 c4 c5

Minimum number of colors required in the equitable coloring of the graph are 5.
Equitable chromatic number, χe(G) = 5.

Maximum vertex degree, ∆(G) = 4.

Odd cycle:
a

b c

Fig 2.9 Odd cycle

Vertex a b c
Color c1 c2 c3

Minimum number of colors required in the equitable coloring of the graph are 3.
22
Equitable chromatic number, χe(G) = 3.

Maximum vertex degree, ∆(G) = 2.

∴ χe(G) ≥ ∆(G)

By the above examples it has clearly shows that the Equitable Coloring Conjecture
(ECC) is true for any connected graphs but neither a complete graph nor an odd
cycle

23