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

150-152
ISSN: 2222-2510
2011 WAP journal. www.waprogramming.com

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

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
prism graph which is denoted by M(Yn) and C(Yn) respectively and harmonious chromatic number for these
graphs. Also we give some structural properties of these graphs.
Keywords: Graph coloring, middle graph, central graph, prism 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 prism graph which is denoted by
M (Yn) and C (Yn) respectively. Also we give some structural properties of these graphs.
II.

PRISM GRAPH

Definition 2.1 A prism graph Yn [21] is graph corresponding to the skeleton of n -prism. An n-prism graph has 2n nodes
and 3n edges, and is equivalent to the generalized Petersen graph Pn, 1.
III.

STRUCTURAL PROPERTIES OF CENTRAL AND MIDDLE GRAPH OF PRISM GRAPH

Let Yn be the prism graph with 2n vertices, has

Maximum degree, (Yn) = 3.

Minimum degree, (Yn) = 3.

Number of vertices in C (Yn), p = 5n.

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

Number of vertices in M (Yn), p = 5n.

Number of edges in M (Yn), q = 12n.

2n vertices of degree 3, 3n vertices of degree 6.

150

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

Maximum degree [M (Yn)] = 6.

Minimum degree [M (Yn)] = 3.

IV.

HARMONIOUS COLORING OF PRISM GRAPH

Theorem 4.1 For the prism graph, the harmonious chromatic number for M (Yn) of prism graph Yn is 4n.
i.e. H [M (Yn)] = 4n.
Proof. Let Yn be the prism graph having 2n vertices and 3n edges.
Let V(Yn) ={u1,u2,u3,,un,v1,v2,v3,,vn} (taken in order clockwise)
Now by definition of middle graph, each edge of the prism graph is subdivided by a new vertex therefore assume that
each edge (vi,vi+1), (ui,ui+1), (vn,v1), (un,1) and (vj, uj) for 1 i n-1, 1 j n, is subdivided by the vertex vi,i+1,
ui,i+1 vn,1, un,1 and ej for 1 i n - 1 1 j n respectively.
Let M = { vi, i+1, ui,i+1, vn,1 , un,1 and ej : 1 i n - 1 & 1 j n }.
Clearly V[M(Yn)] = vi U ui U vi,i+1 U ui,i+1 U vn,1 U un,1Uej for 1 i n- 1 & 1 j n.
Now we, assign the coloring to these vertices of M (Yn) as follows:
Consider a color class
C = {c1,c2,c3,cn,c2n,c2n+1,.c3n,c3n+1,...c4n}.
For 1 i n, assign the color ci to vi & color ci+1 to ui. For 1 i n-1, assign the color c2n+i to the vertices vi,i+1 and
color c3n to vn,1. For 1 i n, 1 j n assign the color c3n+i to ej.
To color remaining vertices assign the color c1 to u1+i,2+i for 1 i n-2, color cn-1 to un,1 and at last assign the color cn
to u1,2.
Therefore above said 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 (Yn)] = 4n.
Example 4.1 Prism graph Y3 and its middle graph M (Y3) shown in figure:
Y3

M (Y3)

Figure 1

Figure 2
H [M(Y3)] = 4.3=12

Theorem 4.2
The harmonious chromatic number for central graph C (Yn) of prism graph Yn is 2n +3 if n is even.
i.e. H [C (Yn)] = 2n + 3
Proof. Let Yn be the prism graph having 2n vertices and 3n edges.
Let V (Yn) = { u1, u2, u3,, un, v1, v2, v3,, vn } (taken in order clockwise)
Now by definition of central graph, each edge of the prism graph is subdivided by a new vertex therefore assume that
each edge (vi, vi+1), (ui, ui+1), (vn, v1) , (un, v1) and (vj, uj) for 1 i n 1, 1 j n is subdivided by the vertex vi,i+1,
ui,i+1 vn,1, un,1 and ej for 1 i n - 1 1 j n respectively.
Let M= { vi,i+1, ui,i+1 vn,1, un,1 and ej : 1 i n 1, 1 j n }.
Clearly V[C (Yn)] = vi (1 i n) U ui (1 i n) U vi,i+1 U vn,1 U vn,1 U ej : 1 i n 1, 1 j n
Now we, assign the coloring to these vertices of C (Yn) as follows:
Consider a color class
C = { ci, c2, c3,., cn,, c2n, c2n+1, c2n+2, c2n+3 }.
For 1 i n, assign the color ci to vi & color ci+1 to ui.
For (odd i even j, 1 i n, 2 j n) assign the color c2n+1 to the vertices vi,j and ui,j.
For
(even i odd j, 2 i n, n - 1 j 1), assign the color c2n+2 to the vertices vi,j and ui,j and at last assign the color
151

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

c2n+3 to ej for 1 j n. We have assigned here the total color 2n + 3 and above said 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 (Yn)] = 2n + 3
Example 4.2 Prism graph Y4 and its central graph C (Y4) shown in figure:
Y4

C (Y4)

Figure 3

Figure 4
H[C(Y4)] = 2.4 + 3=11
ACKNOWLEDGMENT

I am highly thankful to Akbar Ali. M. M, Asst. Prof. (S.G), Department of Mathematics, School of Science and
Humanities, Karunya University, Tamil Nadu (India). I am also thankful to Dr. Brijendra Singh, Prof., Deptt. of
Mathematics, Vikram University, Ujjain, MP (India) and Dr. A.K. Ganguly, Prof. and Dean Admin, SGSITS, Indore,
MP (India) for his kind guidance and support in writing this paper.
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.

152