HARMONIOUS COLORING OF MULTICOPY OF COMPLETE GRAPHS

Year 2019, Volume: 9 Issue: 2 , 384 - 395 , 01.06.2019

F. A. Muntaner-batle V. Vivin J. Venkatachalam M.

https://izlik.org/JA85KZ65UP

Abstract

In this paper, we find the harmonious chromatic number of multicopy ofcomplete graphs Kn. We generalize the result χH n + 2 K >n + 1 given in [8]

Keywords

Harmonious coloring , Corona product , Pigeonhole Principle.

References

• [1] Frucht, F. and Harary, F., (1970), On the corona of two graphs, Aequationes Mathematicae, 4, pp. 322-325.
• [2] Frank, O., Harary F. and Plantholt, M, (1982), The line distinguishing chromatic number of a graph, Ars Combinatoria, 14, pp. 241-252.
• [3] Georges J. P., (1995), On Harmonious Coloring of Collections of Graphs, Journal of Graph Theory, 20(2), pp. 241-245.
• [4] Harary, F. and Plantholt. M., (1983), Graphs with the line distinguishing chromatic number equal to the usual one, Utilitas Mathematica, 23, pp. 201-207.
• [5] Hopcroft, J. and Krishnamoorthy, M.S., (1983), On the harmonious coloring of graphs, SIAM Journal of Algebra Discrete Mathematics, 4, pp. 306-311.
• [6] Jensen, T. R. and Bjarne, T., (1995), Graph coloring problems, New York, Wiley-Interscience.
• [7] Kubale, M., (2004), Graph Colorings, American Mathematical Society Providence, Rhode Island.
• [8] Muntaner-Batle, F. A., Vernold Vivin, J. and Venkatachalam, M., (2014), Harmonious Coloring on Corona Product of Complete Graphs, National Academy Science Letters, 37(5), pp. 461-465, DOI 10.1007/s40009-014-0256-1.
• [9] Wilson, B., (1990), Line Distinguishing and Harmonious Colorings, Graph Colouring, (eds.R. Nelson and R. J. Wilson) Pitman Research Notes in Mathematics 218, Longman Scientific and Technical, Essex, pp. 115-133.