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...
Sábháilte in:
| Príomhchruthaitheoirí: | , , , |
|---|---|
| Formáid: | Academic Paper |
| Foilsithe / Cruthaithe: |
International Journal of Advanced Engineering Research and Science (IJAERS), [Vol-4, Issue-4, Apr- 2017],
2020-06-25T03:29:06Z.
|
| Ábhair: | |
| Rochtain ar líne: | Get Fulltext |
| Clibeanna: |
Cuir clib leis
Níl clibeanna ann, Bí ar an gcéad duine le clib a chur leis an taifead seo!
|
Ar líne
Get Fulltext3rd Floor Main Library
| Gairmuimhir: |
A1234.567 |
|---|---|
| Cóip 1 | Ar fáil |