Please use this identifier to cite or link to this item: https://idr.l4.nitk.ac.in/jspui/handle/123456789/11374
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHegde, S.M.-
dc.contributor.authorCastelino, L.P.-
dc.date.accessioned2020-03-31T08:31:14Z-
dc.date.available2020-03-31T08:31:14Z-
dc.date.issued2011-
dc.identifier.citationAKCE International Journal of Graphs and Combinatorics, 2011, Vol.8, 2, pp.151-159en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/11374-
dc.description.abstractLet D be a directed graph with n vertices and m edges. A function f: V (D) ? {1, 2, 3, ..., t}, where t ? n is said to be a harmonious coloring of D if for any two edges xy and uv of D, the ordered pair (f(x), f(y)) ? (f(u), f(v)). If no pair (i, i) is assigned, then f is said to be a proper harmonious coloring of D. The minimum t for which D admits a proper harmonious coloring is called the proper harmonious coloring number of D. We investigate the proper harmonious coloring number of graphs such as alternating paths and alternating cycles.en_US
dc.titleFurther Results on Harmonious Colorings of Digraphsen_US
dc.typeArticleen_US
Appears in Collections:1. Journal Articles

Files in This Item:
File Description SizeFormat 
5 Further Results on Harmonious Colorings.pdf317.92 kBAdobe PDFThumbnail
View/Open


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