Open AccessHarmonious Coloring for Subdivision of Certain Classes of Graph
Author(s) -
Franklin Thamil,
A. Amutha
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.c1050.1083s219
Subject(s) - subdivision , combinatorics , mathematics , graph , edge coloring , chromatic scale , graph coloring , graph power , geography , line graph , archaeology
For any graph G, χ_h (G) is the extremely small number of colors used in a graph such that no two nearby vertices gets a similar color and every mix of color appears to be together on atmost one edge. In this article we have decided the harmonious chromatic number of subdivision of certain groups of graphs.