• HARMONIOUS COLORING OF CENTRAL GRAPH OF SOME TYPES OF GRAPHS
Abstract
Harmonious colouring is a proper vertex colouring such that no two edges share the same colour pair. The harmonious Chromatic number of a graph is the least number of colours in such a colouring. The purpose of this paper is to study the harmonious coloring of central graph of flower graph, belt graph, rose graph and steering graph and harmonious chromatic number for these graphs. Also we give some structural properties of these graphs.
Keywords
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |