On r-Dynamic Chromatic Number of the Corronation of Path and Several Graphs

Abstract

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.