HARMONIOUS COLORING OF SOME CLASSES OF DIRECTED TREES
0
조회
0
다운로드
0
인용
0
참고문헌
키워드
초록
The proper harmonious coloring number of a digraph D is the least number of colors needed to label the vertices of D such that adjacent vertices receive different colors and no two arcs are incident with the same pair of colors. In this paper we investigate the proper harmonious coloring number of certain classes of directed trees such as bistar, centipede and banana tree.
Abstract
The proper harmonious coloring number of a digraph D is the least number of colors needed to label the vertices of D such that adjacent vertices receive different colors and no two arcs are incident with the same pair of colors. In this paper we investigate the proper harmonious coloring number of certain classes of directed trees such as bistar, centipede and banana tree.
참고문헌 (8)
- F. Harary, "Graph Theory" (1972), Addison Wesley, Academic Press
- G. Chartrand, "Graphs & Digraphs" (2004), A CRC Press Company
- J. E. Hopcroft, "On the harmonious coloring of graphs", SIAM Journal of Alg. Discrete Methods, 4, pp.306~311 (1983)
- "A Bibliography of Harmonious Colourings and Achromatic Number" (2009)[URL]
- K. J. Edwards, "Harmonious chromatic number of directed graphs", Discrete Applied Mathematics, 161, pp.369~376 (2013)
- S. M. Hegde, "Harmonious colorings of digraphs", ARS Combinato-ria, 119, pp.339~352 (2015)
- S. M. Hegde, "Further results on harmonious colorings of digraphs", AKCE International journal of Graphs and Combinatorics, 8, pp.151~159 (2011)
- S. M. Hegde, "On harmonious colorings of regular digraphs", Journal of Graph Labeling, 01, pp.56~63 (2015)