Please use this identifier to cite or link to this item: https://idr.l1.nitk.ac.in/jspui/handle/123456789/11458
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHegde, S.M.-
dc.contributor.authorCastelino, L.P.-
dc.date.accessioned2020-03-31T08:31:26Z-
dc.date.available2020-03-31T08:31:26Z-
dc.date.issued2015-
dc.identifier.citationArs Combinatoria, 2015, Vol.119, , pp.339-352en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/11458-
dc.description.abstractLet 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.en_US
dc.titleHarmonious colorings of digraphsen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
File Description SizeFormat 
13 Harmonious Coloring Of Digraphs.pdf3.17 MBAdobe PDFThumbnail
View/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.