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 an r-dynamic 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 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 G⨀â–'H. We will obtain the r-dynamic chromatic number of χ_r (P_n⨀P_m ),χ_r (P_n⨀C_m )"and " χ_r (P_n⨀W_m ) for m, n>= 3.