On the family of r-regular graphs with Grundy number r + 1

Abstract

The Grundy number of a graph G, denoted by Γ(G), is the largest k such that there exists a partition of V(G), into k independent sets V1,...,Vk and every vertex of Vi is adjacent to at least one vertex in Vj, for every j