On r-Dynamic Chromatic Number of the Corronation of Path and Several Graphs
This study is a natural extension of k -proper coloring of any simple and connected graph G. By a n rdynamic coloring of a graph G, we mean a proper k coloring of graph G such that the neighbors of any vertex v receive at least min{r, d(v)} different colors. The r-dynamic chromatic number, written a...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | Academic Paper |
| 出版: |
International Journal of Advanced Engineering Research and Science (IJAERS), [Vol-4, Issue-4, Apr- 2017],
2020-06-25T03:29:06Z.
|
| 主题: | |
| 在线阅读: | Get Fulltext |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|