paper

On the family of -regular graphs with Grundy number

arXiv:1312.6503

Abstract

The Grundy number of a graph , denoted by , is the largest such that there exists a partition of , into independent sets and every vertex of is adjacent to at least one vertex in , for every . The objects which are studied in this article are families of -regular graphs such that . Using the notion of independent module, a characterization of this family is given for . Moreover, we determine classes of graphs in this family, in particular the class of -regular graphs without induced , for . Furthermore, our propositions imply results on partial Grundy number.