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...
Gardado en:
| Main Authors: | , , , |
|---|---|
| Formato: | Academic Paper |
| Publicado: |
International Journal of Advanced Engineering Research and Science (IJAERS), [Vol-4, Issue-4, Apr- 2017],
2020-06-25T03:29:06Z.
|
| Subjects: | |
| Acceso en liña: | Get Fulltext |
| Tags: |
Engadir etiqueta
Sen Etiquetas, Sexa o primeiro en etiquetar este rexistro!
|
Internet
Get Fulltext3rd Floor Main Library
| Número de Clasificación: |
A1234.567 |
|---|---|
| Copia 1 | Dispoñible |