On harmonious chromatic number of triple star graph
A Harmonious coloring of a graph G is a proper vertex coloring of G, in which every pair of colors appears on at most one pair of adjacent vertices and the harmonious chromatic number of graph G is the minimum number of colors needed for the harmonious coloring of G and it is denoted byXH(G).The pur...
Saved in:
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Mohaghegh Ardabili
2016-06-01
|
| Series: | Journal of Hyperstructures |
| Subjects: | |
| Online Access: | https://jhs.uma.ac.ir/article_2651_3d7dbbe6571d6251ecf5ae4c655510dd.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|