Harmonious Coloring of Certain Graphs
Main Article Content
Abstract
A Harmonious coloring of a graph is a proper vertex coloring of , in which each pair of colors performs on at most one pair of adjacent vertices and the harmonious chromatic number of graph is the minimum number of colors needed for the harmonious coloring of and it is denoted by 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.
Article Details
Issue
Section
Articles