On r-Dynamic Chromatic Number of the Corronation of Path and Several Graphs
Arika Indah Kristiana, Dafik Dafik, Mohammad Imam Utoyo, Ika Hesti Agustin · International Journal of Advanced Engineering Research and Science · 2017
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 kcoloring 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 as r(G), is the minimum k such that graph G has an r-dynamic k -coloring.In this paper we will study the r-dynamic chromatic number of the coronation of path and several graph.We denote the corona product of G and H by 𝐺 ⨀ 𝐻.We will obtain the rdynamic chromatic number of 𝜒 𝑟 ( 𝑃 𝑛 ⨀𝑃 𝑚 ) , 𝜒 𝑟 ( 𝑃 𝑛 ⨀𝐶 𝑚 ) and 𝜒 𝑟 ( 𝑃 𝑛 ⨀𝑊 𝑚 ) for m, n 3. Keyword-r-dynamic chromatic number, path, corona product.I.