World Applied Programming, Vol (2), No (3), March 2012.

146-149
ISSN: 2222-2510
2011 WAP journal. www.waprogramming.com

On Harmonious Coloring of M(Ln) and C(Ln)

Akhlak Mansuri*
Department of Mathematics
Govt. Geetanjali Girls College
Bhopal, India
mansuri_akhlaak@yahoo.com

R. S. Chandel
Department of Mathematics
Govt. Geetanjali Girls College
Bhopal, India
rs_chandel2009@yahoo.co.in

Vijay Gupta
Department of Applied Mathematics
UIT, RGPV
Bhopal, India
vkgupta_12873@rediffmail.com

Abstract: The purpose of this paper is to study the harmonious coloring of middle graph and central graph of
ladder graph which is denoted by M(Ln) and C(Ln) respectively and harmonious chromatic number for these
graphs. Also we give some structural properties of these graphs.
Keywords: Graph coloring, middle graph, central graph, ladder graph, harmonious coloring and harmonious
chromatic number.
Mathematics Subject Classification: 05C75, 05C15.
I.

INTRODUCTION

Throughout the paper we consider the graph G as a finite undirected with no loops and multiple edges. Let G be a
graph with vertex set V (G) and the edge set E (G). The middle graph [9, 17] of G denoted by M (G) and defined as
follows. The vertex set of middle graph M(G) is V(G)U E(G) and two vertices x, y in the vertex set of M(G) are
adjacent in M(G) in case one of the following holds:
(i) x, y are in E(G) and x, y are adjacent in G (ii) x is in V(G), y in E(G) and x, y are incident in G. Graph coloring
[8] is an assignment of colors to the vertices of graph G such that no any two adjacent vertices share the same color. A
harmonious coloring [2, 3, 4, 5, 7, 10, 12 ,13, 14, 15, 16, 17, 18, 19, 20 ] of a graph G is a proper vertex coloring of
vertices in which every pair of colors appears 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. The central graph
[13, 17, 19, 20] of any graph G is obtained by subdividing each edge of G exactly once and joining all the non adjacent
vertices of G. By the definition pC(G) =p + q. For any (p, q) graph there exactly p vertices of degree p -1 & q vertices
of degree 2 in C (G).
In this paper we, study the harmonious coloring of middle graph and central graph of ladder graph which is denoted
by M (Ln) and C (Ln) respectively. Also we give some structural properties of these graphs.
II.

LADDER GRAPH

Definition 2.1 A ladder graph Ln [21] of order n is a planer undirected graph with 2n vertices and n+2(n-1) edges.
III.

STRUCTURAL PROPERTIES OF CENTRAL AND MIDDLE GRAPH OF LADDER GRAPH

Maximum degree, (Ln) = 3.

Minimum degree, (Ln) = 2.

Number of vertices in C (Ln), p = 5n-2.

Number of edges in C (Ln), q = 2n2+2n-2.

Number of vertices in M (Ln), p=5n-2.

Number of edges in M (Ln), q = 10n-8.

n-2 vertices of degree 6, 2n vertices of degree 4, 2n-4 vertices of degree 3 and 4 vertices of degree 2.

Maximum degree [M (Ln)] = 4.

Minimum degree [M (Ln)] =2.

146

Akhlak Mansuri et al., World Applied Programming, Vol (2), No (3), March 2012.

IV.
Theorem 4.1
respectively.

HARMONIOUS COLORING OF LADDER GRAPH

The harmonious chromatic number for C (Ln) is 2n+3 for n > 2 and it is 2n+1 & 2n+2 for n=1, 2

2 n + 3 , ifn > 2

i.e. H[C (Ln)] = 2 n + 1 , i f n = 1

2 n + 2 , i f n = 2
Proof. Let Ln be the ladder graph with 2n vertices and 3n-2 edges.
Let v1, v2, v3,, vn, u1, u2, u3,,un be the vertices of ladder graph Ln.
i.e.
V (Ln) = { v1, v2,v3,, vn, u1, u2, u3,,un }.
Now by definition of central graph, each edge of graph is subdivided by a new vertex therefore assume that each edge
(vi, vi+1), (ui, ui+1), and (vj, uj) is subdivided by the vertex vi ,i+1, ui ,i+1 and ej for 1 i n-1 & 1 j n respectively.
Let M ={ vi,i+1, ui,i+1 and ej : 1 i n-1 & 1 j n}.
Now we assign the coloring to these vertices as follows:
Consider a color class
C = {c1, c2, c3,, c2n+1, c2n+2, c2n+3}.
Assign the color ci to the vertices vi and cn+i to the vertices ui for 1 i n.
For coloring of vi, i+1 and ui, i+1 : assign the color c2n+1 for odd i ( i = 1,3,5, ), color c2n+2 for even i
( i=
2,4,6, ) and color c2n+3 to the vertices ej for 1 j n.
Thus coloring is proper.
Clearly for any cycle C4 there exists a different color and two same colors is assigned, at least at the distance 3.
Therefore the coloring is obviously harmonious and also the coloring is minimum because if we replace any color,
which is minimum in number by a color already used, then the resulting coloring will be improper or not harmonious.
Hence H[C (Ln)] = 2n+3

Example 4.1 for n > 2

Figure 1

H[C (L3)] = 2.3 + 3 = 9.

147

Akhlak Mansuri et al., World Applied Programming, Vol (2), No (3), March 2012.

Example 4.2 for n =1

Figure 2
H[C (L1)] = 2.1 + 1 = 3.

Example 4.3 for n = 2

Figure 3
H[C (L2)] = 2.2 + 2 = 6.
Theorem 4.2 The harmonious chromatic number for middle graph of ladder graph Ln is 3n
i.e. H [M (Ln)] =3n.

Proof. Let Ln be the ladder graph with 2n vertices and 3n-2 edges.
Let v1, v2, v3,,vn, u1, u2, u3,,un be the vertices of ladder graph Ln.
i.e.
V (Ln) = { v1, v2, v3,,vn, u1, u2, u3,,un}.
Now by definition of middle graph, each edge of graph is subdivided by a new vertex therefore assume that each
edge (vi,vi+1 ), (ui, ui+1) and (vj, uj) is subdivided by the vertex vi, i+1, ui, i+1 and ej for 1 i n-1
&1jn
respectively.
Let M= { vi, i+1, ui, i+1 and ej : 1 i n-1 & 1 j n}.
Now we assign the coloring to these vertices as follows:
Consider a color class
C= {c1, c2, c3, , cn, , c2n, c2n+1, , c3n}.
Assign the color ci to the vertices vi, i+1 and cn-1+i to the vertices ui, i+1 for 1 i n-1. For coloring of ej: Assign c2n-2+i to
ej for 1 j n. Now to color vi and uj: assign the color c3n-1 to vi and uj for odd i (i =1, 3, 5, )
& even j ( j
=2,4,6, ), c3n for even i ( i =2,4,6, ) & odd j (j =1,3,5, ).
Thus coloring is proper.
Clearly for any cycle C4 there exists a different color and any two same colors is assigned, at least at the distance 3.
Therefore the coloring is obviously harmonious and also the coloring is minimum because if we replace any color,
which is minimum in number by a color already used, then the resulting coloring will be improper or not harmonious.
Hence H [M (Ln)] = 3n.

148

Akhlak Mansuri et al., World Applied Programming, Vol (2), No (3), March 2012.

Example 4.4

Figure 4
H[M(L3)] = 3.3 = 9.

ACKNOWLEDGMENT
I am highly thankful to Dr. M. A. Pathan, Retd. Prof. Aligarh Muslim University, UP (India) for his kind guidance and
support in writing this paper. I am also thankful to Dr. Dolly Malhotra, Principal, Govt. Geetanjali Girls College,
Bhopal, MP (India) for his kind support at the research center.

REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
[10]
[11]
[12]
[13]
[14]
[15]
[16]
[17]
[18]
[19]

[20]
[21]

J. A. Bondy and U. S. R. Murty, Graph theory with Applications, London Macmillan (1976).
Keith Edwards, The harmonious chromatic number of almost all graphs, Journal of the London Mathematical Society (series 2), (55, 435-447
(1997)).
K. J. Edwards, The harmonious chromatic number of almost all trees, Combinatorics, Probability and Computing, 4 (1995), pp. 3146.
K. J. Edwards, The harmonious chromatic number of bounded degree trees, Combinatorics, Probability and Computing, 5 (1996), pp. 1528.
K. J. Edwards, A new upper bound for the harmonious chromatic number, Journal of Graph Theory, 29 (1998), pp. 257261.
Frank Harary, Narosa Publishing Home, (2001).
J. Hopcroft and M.S. Krishnamoorthy, On the harmonious colouring of graphs,
Graph Coloring, Wikipedia, the free encyclopedia, SIAM J. Algebra Discrete Math 4 (1983)
pp. 306-311.
Danuta Michalak, On middle and total graphs with coarseness number equal 1, Graph theory, Proc. Conf., Lagow/Pol. 1981, Lect. Notes
Math. 1018, Springer, Berlin 1983, 139-150.
Z. Miller and D. Pritikin, The harmonious coloring number of a graph, Discrete Mathematics, 93 (1991), pp. 211228.
Wilson Robin . J, Introduction to Graph Theory.
K. Thilagavathi and Vernold Vivin .J, Harmonious coloring of Graphs, Far East J. Math. Sci., 20,
189-197 (2006).
K. Thilagavathi, D. Nidha, N. Roopesh, On harmonious coloring of C(Wn) and C(Fm,n), Electronics Notes in Discrete mathematics, (33, 9599 (2009)).
K.Thilagavathi and Vernold Vivin.J, Harmonious Colouring of Graphs, Far East J. Math. Sci. (FJMS), Volume 20, No.2 (2006) pp. 189-197.
K.Thilagavathi, Vernold Vivin.J and Anitha. B, On Harmonious Colouring of L[C(K1,n)] and[C(Cn)] Proceedings of the International
Conference on Mathematics and Computer Science, Loyola College, Chennai, India. (ICMCS 2007), March 1-3, 2007, pp. 189-194.
K.Thilagavathi and Vernold Vivin.J, Harmonious colouring of cycles, regular
graphs, star n-leaf, festoon trees and bigraphs, Far East J.
Math. Sci. (FJMS) Volume 26, No.3 (2007) pp.779-788.
Vernold Vivin. J and Akbar Ali.M.M On Harmonious Coloring of Middle Graph of C (Cn), C (K1, n) and C (Pn), Note di Matematica, 29
(2009), n. 2, 201-211.
Vernold Vivin.J, Ph.D Thesis, Harmonious Coloring of Total Graphs, nLeaf, Central graphs and Circumdetic Graphs, Bharathiar University,
Coimbatore, 2007.
Vernold Vivin.J, Akbar Ali.M.M and K.Thilagavathi, Harmonious Coloring on Central Graphs of Odd Cycles and Complete Graphs,
Proceedings of the International Conference on Mathematics and Computer Science, Loyola College, Chennai, India. (ICMCS 2007), March
1-3, 2007, pp. 74-78.
Vernold Vivin .J, Akbar Ali.M.M and K Thilagavathi, On harmonious coloring of Central graph, Advances and Applications in Discrete
Mathemetics. (2, 17-33, (2008)).
M. Weisstein, Eric W., "Ladder Graph" from MathWorld, Wikipedia, the free Encyclopedia.

149