JOURNAL OF ALGEBRAIC STATISTICS

Volume 13, No. 1, 2022, p. 5480 - 5487

https://publishoa.com
ISSN: 1309-3452

Harmonious Coloring of Certain Graphs

1
N. Ananthi2V.T. Chandrasekaran
1
Research scholar
Affiliated to THIRUVALLUVAR UNIVERSITY-Vellore, India
2
Associate Professor, Jawahar Science College Neyveli-607003
Affiliated to THIRUVALLUVAR UNIVERSITY-Vellore, India

Abstract
A Harmonious coloring of a graph G is a proper vertex coloring of G , in which each pair of colors performs on at
most one pair of adjacent vertices and the harmonious chromatic number of graph G is the minimum number of
colors needed for the harmonious coloring of G and it is denoted by H G  . In this paper to find the harmonious
chromatic number of Complement of some graphs, central graph of triangular cactus graph and middle graph of
Firecracker graph.

Keywords: Coloring, Harmonious coloring, Cartesian product, Rooted product

Mathematics Subject Classification: 05C62, 68R10

Introduction:
Graph Theory is one of the most emerging branches of mathematics with wide-ranging applications to
computer science. Graph Theory is applied in diverse areas such as communication engineering, social sciences,
physical sciences, linguistics and others. Graph coloring is one of the eldest and an interesting problem that comes
up in a lot of applications. Graph coloring is an assignment of colors to the vertices of a graph. A vertex coloring is
called proper coloring if no two adjacent vertices of the graph get the same color and the graph is at that time called
properly colored graph. Several problems can be communicated as a graph coloring problem including time tabling,
scheduling, register allocation, channel assignment in radio stations such that no station has a conflict.
There are several problems in graph coloring, one such problem is harmonious coloring problem. A
harmonious coloring of a simple graph is the proper vertex coloring such that each pair of colors appears together on
at most one edge. The harmonious chromatic number of G, denoted by H G  is the least number of colors in a
harmonious coloring of G [3,7]. Harmonious coloring was first introduced by Frank Harray and M. J. Plantholt in
1982. However the proper definition of this notion is due to Lee Hopcroft and Krishnamoorty [4]. The harmonious
chromatic number of several different families of graph has been found by different author. The lower bound of
harmonious chromatic number may be considered as an edge receiving a unique color pair. Moreover if
E G k C , then a graph is harmoniously colored with k colors. Paths and cycles were the first graphs whose
2
harmonious chromatic numbers have been established. Therefore, there be present to finding the exact bound for the
graphs such as the collection of non-trivial disjoint of paths graph, cycle graph, complete graphs, trees, triangular
snake graphs, double triangular snake graphs, and diamond snake graphs[1,4,6,8] Away from each other, Lee and
Mitchem [5] provided an upper bound for harmonious chromatic number of a graph.

Theorem 2.1:
For any path graph Pn the harmonious coloring of complement of path graph is n .

i.e., If Pn is a path graph, then  

 H Pn  n , for n  4
Proof:
Let us consider the vertices of path Pn are v1, v2 , v3 ,..., vn .
From the complement of path graph, we obtain two different set of degree sequences, one set has degree
n  2 , and another one has degree n  3 .

1
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 1, 2022, p. 5480 - 5487
https://publishoa.com
ISSN: 1309-3452

That is deg(v1)  deg(vn )  n  2 I1and deg(v2 )  ...  deg(vn1)  n  3 I2 .

v2 . Similarly vn is adjacent to other than vn1 .
i.e., v1 is adjacent to all the vertices other than
Therefore, we need n 1 colors for v1 and the neighbors of v1 (or and the neighbors of vn ) at this point let us
vn
choose n th color to the vertex v2 since the neighbors of v2 are all same as for v1 .
Suppose we assign v2 and v3 are same color which is contradiction to definition of harmonious coloring,
since v2 and v3 are not adjacent as well as the neighbors of v1 and the neighbors of v3 are same.
Therefore, each vertex has assigned different color. That is, we can assign n colors to complement of path
graph.

 
 H Pn  n

P5

𝑣2 𝑣4 𝑣5
𝑣1 𝑣 3

Theorem 2.2:
For any cycle graph Cn the harmonious coloring of complement of cycle is n , for n  5 .
i. e, If  
Cn is a cycle graph then  H Pn  n .
Proof:
Let Cn be a cycle graph the vertices of cycle graph is1, 2,3,..., n .
The complement Cn is a regular graph of degree n  3 for n  5 .
Therefore, we need
n colors for v1 and some the neighbors of v1 , from Cn the vertex v1 is not
2
adjacent to v2 and vn as well as the neighbors of v1 is adjacent to either v2 or vn . So the existing color is not
possible to assign to v2 and vn .
Therefore we choose a color n 1 and n for v2 and vn respectively.

That is we can easily assign n color to Cn .

2
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 1, 2022, p. 5480 - 5487
https://publishoa.com
ISSN: 1309-3452

𝑉1

𝑉2

𝑉6

C6 :

𝑉3
𝑉5

𝑉4

Theorem 2.3:
For any wheel graph Wn , n  5 the harmonious coloring on complement of wheel graph is n 1.
i.e., If  
Wn is a wheel graph then,  H Wn  n 1.
Proof:
Let Wn be a wheel graph the vertices of wheel graph is 1, 2,3,, n 1 .
The complement of wheel graph Wn produces two components, one component covering a pendent vertex
only, and the second components covering a graph with n 1 vertices which is a regular graph of degree n  2 .
That is the second component is similar to the harmonious coloring of complement of cycle, so by the
previous theorem, second components has n 1 colors for n 1 vertices.
Without loss generality once again we choose same color for the first component covering vertex v1 , since
v1 is not adjacent to v2 , v3 ,..., vn .

 
  H Wn  n 1 .

3
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 1, 2022, p. 5480 - 5487
https://publishoa.com
ISSN: 1309-3452

𝑉1
W7 :
𝑉2
𝑉6

𝑉5
𝑉3

𝑉4

Theorem 2.4:
For any star graph Sn , n  3 the harmonious coloring on complement of star graph is n 1.
i,e., If S n is a star graph then  
 H Sn  n 1, for n  3 .
Proof:
Let Sn be a star graph the vertices of star graph 1, 2,, n 1 . By the definition of complement of star
graph, we obtain one vertex has degree zero and remaining vertices has degree n  2 .
For, n  4 , the complement of star graph produces two components, one is a pendent vertex, and another one
has a complete graph of degree n 1. We can assign n 1 colors to the complement of star graph.

 
  H Sn  n 1 .

S6 : 𝑉1

𝑉5 𝑉2
𝑉6

𝑉4 𝑉3

Theorem 2.5:
For any ladder graph Ln , the harmonious coloring of complement of ladder graph is 2n 1.
i.e., if 𝐿𝑛 is a ladder graph, then  
 H Ln  2n 1 .

4
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 1, 2022, p. 5480 - 5487
https://publishoa.com
ISSN: 1309-3452

Proof:
Let Ln be a ladder graph the vertices of ladder graph are v11, v12 ,..., v1n , v21, v22 ,..., v2n . By the definition,
the complement of ladder graph, we obtain each vertex has degree n 1,  we can get 2n vertices has degree
n 1.
At this moment v1i is adjacent to v2 j for i  j , we can assign a colors to the neighbours of v1 is n 1
similarly for neighbour of v2 .
i. e, v1 and v2 has some color and neighbour are all distinct.
We can assign 2n 1 colors to color the complement of ladder graph.

 
  H Ln  2n 1.
Theorem:
The harmonious coloring of N copies of complete graph is   N 1
G  N n n  2 and
for
H  
 2 
N  n 1.
.
Proof :
Let k(1) , k(2) , k(3) ,..., k ( N) denote the N copies of complete kn . For N  1, 2,3,..., n 1 and
graph
n n n
n we allocate colors as follows. It is clear that in every complete graph, the harmonious coloring is
2
implemented with separate n colors. Therefore k (1) is assigned with n colors, everywhere k(2) shares one bridge
n n
with k (1) , it needs  n 1 colors which are distinct from the set of colors assigned to k (1) . Similarly k (3) shares
n n n

one edge with k(2) it need  n  2 colors.

Hence k (nN)
shares one edge with k(N1) it need n   N 1 colors.
n n

N (N
Nn 
Clearly we need colors.
1)

  G   N n 2
 H N 1 
.
 2 

𝑐2 𝑐10
𝑐6 𝑐5 𝑐9 𝑐3 𝑐7 𝑐9
𝑐3 𝑐7

𝑐1 𝑐4 � 5 𝑐8
𝑐2 𝑐1 𝑐6
�

5
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 1, 2022, p. 5480 - 5487
https://publishoa.com
ISSN: 1309-3452
𝑐8 𝑐10

Theorem 2.6
If G be a triangular cactus graph then the harmonious coloring on complement of Triangular cactus graph
is 2n .
Proof:

6
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 1, 2022, p. 5480 - 5487
https://publishoa.com
ISSN: 1309-3452

Let us consider the triangular cactus graph with2n 1 vertices and $3n$ edges. Let us label the vertices
of the triangular cactus graph are v1, v2 , v3,, vn , vn1, vn2,, v2n . Here v1, v2 , v3,, vn &
v2n n 1 vertices has degree 2 and vn1, vn2 ,, v2n1 n 1vertices has degree 4.
By the definition of complement of graph, the vertices v1, v2 , v3,, vn , vn1, vn2,, v2nhas degree

n  3 and the vertices vn1, vn2 ,, has degree n5. Therefore the neighbors of
v2n1
vn1, vn2 ,, v2n1are adjacent to neighbors of vn1, vn2 ,, v2n1, at this present we can allot
each vertex as different colors. That is, the harmonious coloring on complement of Triangular cactus graph is 2n .

Triangular cactus graph

Complement of Triangular cactus graph

Theorem 2.7
If G be a triangular cactus graph then the harmonious coloring on central graph of Triangular cactus graph is
2n  3 .
Proof:
Let us consider the triangular cactus graph with 2n 1 vertices and $3n$ edges. Let the vertices of the
triangular cactus graph are v1, v2 , v3,, vn , vn1, u1,, un .
.
By the definition of central graph, each edge of graph is subdivided by a new vertex. Therefore assume that
each edge vi , vi1  and the line joining vi and vi1 to a vertex ui , i  1, 2, 3,, n are subdivided by the vertices
wi , ejj and ej, j1, j  1, 2,3,, n respectively. Assign colors to the vertices as
follows:
vi  i 1  i  n 1
ui & wi  n 1  i 1  i  n

7
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 1, 2022, p. 5480 - 5487
https://publishoa.com
ISSN: 1309-3452

ejj  2n 1 11  j  n

ej, j1  2n  2 11 j  n


Clearly, Tn has 2n  3 coloring.

Clearly it is a proper coloring. Since every v , u and its neighbors obtain distinct colors. Further color of
i i

vi  color of ui . This is the minimum number of colors in a harmonious coloring.

Suppose Case (i): The color of vi and ui covers 2n 1 colors. If we assign 2n colors, then the colors will
not be distinct colors which are contradiction to the definition of harmonious colors.
Case (ii): The neighbors of u and v are assumed same color, then the color pair duplications which is a
i i
contradiction to the definition of harmonious coloring.
Therefore the minimum number of colors in a harmonious coloring for central graph of triangular cactus
graph is 2n  3 .
Harmonious coloring on Middle graph of firecracker graph  Fn ,3  :
Theorem:3.1
Let G be a middle graph of  Fn , 3, n  5 graph, then the harmonious coloring on middle graph of

 Fn ,3 is 2n .
Proof:
By the definition of Middle graph of  Fn ,3  , G has 2n vertices which is attained by attaching n
pendent edges to the cycle of length n . Let us consider the vertices of Cn are v1, v2 ,..., vn .
As well as the pendent edges are adjacent with vi and viui where ui are the pendent vertices of  Fn ,3  .
Now allot the coloring to the vertices as follows,let us consider the colors are 1, 2, 3,, 2n .
(i)
Assign the color i to ui for 1  i  n .
(ii)
Allot color i to vi for  2  i  n 1 .
Assign color n 
1  i  n 1 .
(iii)
to vi , vi1for
i
Therefore, the number of colors used in middle graph of  Fn ,3  is 2n . Thus above assumed coloring is
clearly harmonious coloring with minimum number of colors, suppose if we replace any color, which is already used
then the resulting coloring will be improper or not harmonious.

References:
1. AkhlakMansuri and R. S. Chandel A note on Harmonious Coloring of n -sunlet Graph International
Journal of Computational Science and Mathematics. Volume 4, Number 3 (2012), pp. 267-270.

2. Aflaki, A. Akbari, S.; Edwards, K.J.; Eskandani, D.S.; Jamaali, M.; Ravanbod, H. (2012) On harmonious
colouring of trees. Electron. J. Comb. 19, 3–11.
3. Georges, J.P. On the harmonious coloring of collections of graphs. (1995) J. Graph Theory, 20, 241–254.
4. Hopcroft, J. Krishnamoorthy, M.S.(1983) On the harmonious coloring of graphs. SIAM J. Algebr. Discrete
Methods, 20, 306–311.
5. Lee, S. Mitchem, J.(1987) An upper bound for the harmonious chromatic number of a graph. J. Graph
Theory, 11, 565–567.
6. Miller, Z. Pritikin, D. (1991) The harmonious coloring number of a graph. Discrete Math, 93, 211–228.

8
JOURNAL OF ALGEBRAIC STATISTICS
Volume 13, No. 1, 2022, p. 5480 - 5487
https://publishoa.com
ISSN: 1309-3452

7. Selvi, M.S.F.T.(2015) Harmonious coloring of central graphs of certain snake graphs. Appl. Math. Sci, 9,
569–578.
8. Zhang, P.(2015) Color-Induced Graph Colorings; Springer: London, UK.