On r-dynamic coloring of subdivision-vertex neighborhood corona of path with certain graphs

Let G be an n-verticed, m-edged finite connected and undirected graph. An r-dynamic coloring of a graph G is a proper k-coloring of a graph G in which the neighbors of any vertex v receives at least min {r, d(v)} different colors. The minimum k such that the graph G has r-dynamic k coloring is called the r-dynamic chromatic number of graph G denoted as χr (G). In this work we obtain the r-dynamic chromatic number of subdivision-vertex neighbourhood corona of path graph Pm with some standard graphs like path graph Pn, cycle graph Cn, complete graph Kn, star graph K1,n and double star graph K1,n,n.