Journal ArticleOPEN ACCESS

On A Harmonious Colouring Graphs And Its Applications

  • Govindarajan M
IOSR Journal of Mathematics (2012) 4(4) 13-17
DOI: 10.9790/5728-0441317
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Harmonious colouring is a proper vertex colouring such that no two edges share the same colour pair. The harmonious Chromatic number) (G h  of a graph is the least number of colours in such a colouring. In this paper we give some new properties of harmonious colouring graphs and its applications.

Cite

CITATION STYLE

APA

Govindarajan, Ms. V. K. || Dr. R. (2012). On A Harmonious Colouring Graphs And Its Applications. IOSR Journal of Mathematics, 4(4), 13–17. https://doi.org/10.9790/5728-0441317

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free