Open AccessOptimization of Harmonious coloring problem in Uniform theta graph and torus Network
Author(s) -
M. Selvi,
A. Amutha
Publication year - 2021
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/1012/1/012061
Subject(s) - graph coloring , fractional coloring , combinatorics , mathematics , edge coloring , brooks' theorem , complete coloring , torus , graph , list coloring , greedy coloring , discrete mathematics , line graph , chromatic scale , computer science , 1 planar graph , graph power , geometry
Coloring of graphs has been extraordinarily widened areas of investigation. A coloring of a graph can be depicted by a capacity that maps pieces of a graph into some plan of numbers commonly called labels or hues, all together that some property is satisfied. In this article we deal with the harmonious chromatic number of central graph of generalized uniform theta graph and torus network. A coloring c : V → ℕ of the nodes is a harmonious coloring if and only if the coloring is proper and for each and every line ( e 1 , e 2 ) ∈ E the line color ( c ( e 1 ), c ( e 2 )) is distinctive that is it emerge solely once.