Grundy number of corona product of some graphs

Abstract

The Grundy number of a graph G is the maximum number k of colors used to color the vertices of G such that the coloring is proper and every vertex u colored with color i, 1 ≤ i ≤ k, is adjacent to i – 1 vertices colored with each color j, 1 ≤ j ≤ i − 1. In this paper we obtain the Grundy number of corona product of some graphs, denoted by G ◦ H. First, we consider the graph G be 2-regular graph and H be a cycle, complete bipartite, ladder graph and fan graph. Also we consider the graph G and H be a complete bipartite graphs, fan graphs.