• ON HARMONIOUS COLORING OF M[B(Kn,Kn)] AND C[B(Kn,Kn)]
Abstract
A harmonious coloring is a proper vertex coloring in which every pair of colors appears on at most one pair of adjacent vertices. In this paper a study of harmonious coloring of and M [B( Kn, Kn)] and C[B(Kn, Kn) ])and their harmonious chromatic number and some structural properties are discussed.
Keywords
Graph coloring, Central graph, Middle graph, Barbell graph, Harmonious coloring and Harmonious chromatic number.
Full Text:
pdfThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |