ON HARMONIOUS COLORING OF C(Hn) AND C (Gn)
Main Article Content
Abstract
A harmonious coloring is a proper vertex coloring in which every pair of colors appears on at most one pair of adjacent vertices. In this paper harmonious coloring of C ( ) and C (Gn) are studied. Some structural properties of them are discussed. Also, their harmonious chromatic number was obtained.
Keywords: Graph coloring, middle graph, helm graph, Gear graph, harmonious coloring and harmonious chromatic number.
Classification number: 05C15, 05C75
Downloads
Article Details
Open Access: This is an open-access journal. All articles published in the Journal of Global Research in Mathematical Archives(JGRMA) are made immediately and permanently available under the Creative Commons Attribution 4.0 International (CC BY 4.0) License. Authors retain the copyright of their work and grant Journal of Global Research in Mathematical Archives(JGRMA) the right of first publication. This license permits unrestricted use, distribution, adaptation, and reproduction in any medium or format, including commercial use, provided the original author(s), source, and license are properly acknowledged.
Google Scholar Indexed | DOI Enabled | OAI-PMH Compliant | Open Access Journal