Open AccessA Performance on Harmonious Coloring of Barbell Graph
Author(s) -
M. Selvi,
A. Amutha
Publication year - 2019
Publication title -
international journal of engineering and advanced technology
Language(s) - English
Resource type - Journals
ISSN - 2249-8958
DOI - 10.35940/ijeat.a2625.109119
Subject(s) - graph coloring , graph , combinatorics , windmill graph , mathematics , simple graph , chromatic scale , wheel graph , critical graph , edge coloring , fractional coloring , computer science , discrete mathematics , graph power , line graph
Given simple graph , a harmonious chromatic number () is the minimum number of colors used in a graph such that no two adjacent vertices receives the same color and each combination of color seems together on atmost one edge. In this article we have determined the harmonious chromatic number of barbell and central graph of barbell graph.Over all we have given an algorithm to calculate the harmonious chromatic number of Barbell graph by depicting a quadratic time.