Harmonious Coloring for Subdivision of Certain Classes of Graph
Franklin Thamil Selvi. M. S1, A. Amutha2

1Franklin Thamil Selvi. M. S, Department of Mathematics, Sathyabama Institute of Science and Technology, India.
2A. Amutha, Department of Mathematics, The American College, Madurai (Tamil Nadu), India.
Manuscript received on 18 November 2019 | Revised Manuscript received on 04 December 2019 | Manuscript Published on 10 December 2019 | PP: 266-268 | Volume-8 Issue-3S2 October 2019 | Retrieval Number: C10501083S219/2019©BEIESP | DOI: 10.35940/ijrte.C1050.1083S219
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

Abstract: 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.
Keywords: Graph Harmonious Subdivision Small.
Scope of the Article: Cryptography and Applied Mathematics