Optimization of Harmonious Coloring Problem in Mesh Derived Architecture
M. S. Franklin Thamil Selvi, A. Amutha · Journal of Physics Conference Series · 2021
Abstract Labelling of graphs has been the allocation of integers to the nodes or edges, or perhaps both, liable to revision. Graph coloring is indeed a specialized version of graph labelling, which is an allocation of labels consists of assessment to as colors to graph that are subject to several limitations. From its simplified sense it is indeed a method to color the nodes of a graph. This article deals with the harmonious coloring of central graph of some Mesh derived Architectures. A coloring is a harmonious coloring if it is a proper coloring with the intension of a couple of colors emerges towards one edge at the most.