Please use this identifier to cite or link to this item:
https://idr.l2.nitk.ac.in/jspui/handle/123456789/11458
Title: | Harmonious colorings of digraphs |
Authors: | Hegde, S.M. Castelino, L.P. |
Issue Date: | 2015 |
Citation: | Ars Combinatoria, 2015, Vol.119, , pp.339-352 |
Abstract: | Let D be a directed graph with n vertices and m edges. A function f: V(D) ? {1, 2, 3, .?} where ? ? n is said to be harmonious coloring of D if for any two edges xy and u? of D, the ordered pair (f(x), f(y)) ? (f(u), f(?)). If the pair (i, i) is not assigned, then / is said to be a proper harmonious coloring of D. The minimum ? is called the proper harmonious coloring number of D. We investigate the proper harmonious coloring number of graphs such as unidirectional paths, unicycles, inspoken (outspoken) wheels, n -ary trees of different levels etc. |
URI: | http://idr.nitk.ac.in/jspui/handle/123456789/11458 |
Appears in Collections: | 1. Journal Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
13 Harmonious Coloring Of Digraphs.pdf | 3.17 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.