Harmonious colorings of digraphs
| dc.contributor.author | Hegde, S.M. | |
| dc.contributor.author | Castelino, L.P. | |
| dc.date.accessioned | 2020-03-31T08:31:26Z | |
| dc.date.available | 2020-03-31T08:31:26Z | |
| dc.date.issued | 2015 | |
| dc.description.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. | en_US |
| dc.identifier.citation | Ars Combinatoria, 2015, Vol.119, , pp.339-352 | en_US |
| dc.identifier.uri | https://idr.nitk.ac.in/handle/123456789/11458 | |
| dc.title | Harmonious colorings of digraphs | en_US |
| dc.type | Article | en_US |
Files
Original bundle
1 - 1 of 1
- Name:
- 13 Harmonious Coloring Of Digraphs.pdf
- Size:
- 3.1 MB
- Format:
- Adobe Portable Document Format