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

preprint2014arXivOpen access

Abstract

The Grundy number of a graph GG, denoted by Γ(G)Γ(G), is the largest kk such that there exists a partition of V(G)V(G), into kk independent sets V1,…,VkV_1,\ldots, V_k and every vertex of ViV_i is adjacent to at least one vertex in VjV_j, for every j<ij < i. The objects which are studied in this article are families of rr-regular graphs such that Γ(G)=r+1Γ(G) = r + 1. Using the notion of independent module, a characterization of this family is given for r=3r=3. Moreover, we determine classes of graphs in this family, in particular the class of rr-regular graphs without induced C4C_4, for r≤4r \le 4. Furthermore, our propositions imply results on partial Grundy number.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.