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...
में बचाया:
| मुख्य लेखकों: | , , , |
|---|---|
| स्वरूप: | Academic Paper |
| प्रकाशित: |
International Journal of Advanced Engineering Research and Science (IJAERS), [Vol-4, Issue-4, Apr- 2017],
2020-06-25T03:29:06Z.
|
| विषय: | |
| ऑनलाइन पहुंच: | Get Fulltext |
| टैग : |
टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!
|
इंटरनेट
Get Fulltext3rd Floor Main Library
| बोधानक: |
A1234.567 |
|---|---|
| प्रति 1 | उपलब्ध |