Author:
Franklin Thamil Selvi M. S,Amutha A.
Abstract
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.
Subject
General Physics and Astronomy
Reference13 articles.
1. The line distinguishing chromatic number of a graph;Frank;Ars Combinatoria,1982
2. On the harmonious coloring of graphs;Hopcroft;SIAM J. Alg. Disc. Meth.,1983
3. The harmonious chromatic number of a complete binary and trinary tree;Zhikang;Discrete Mathematics,1993
4. The harmonious chromatic number of a complete 4-ary tree;Zhikang;Journal of Mathematical Research and Exposition,1995
5. The harmonious chromatic number of almost all trees;Edwards;Combinatorics, Probability and Computing,1995