Grundy Domination and Zero Forcing in Kneser Graphs
Ars mathematica contemporanea(2019)
摘要
In this paper, we continue the investigation of different types of (Grundy) dominating sequences. We consider four different types of Grundy domination numbers and the related zero forcing numbers, focusing on these numbers in the well-known class of Kneser graphs K-n,K-r. In particular, we establish that the Grundy total domination number gamma(t)(gr) (K-n,K-r) equals ((2r)(r)) for any r >= 2 and n >= 2r + 1. For the Grundy domination number of Kneser graphs we get gamma(gr) (K-n,K-r) = alpha(K-n,K-r) whenever n is sufficiently larger than r. On the other hand, the zero forcing number Z(K-n,K-r) is proved to be ((n)(r)) - ((2r)(r)) when n >= 3r + 1 and r >= 2, while lower and upper bounds are provided for Z(K-n,K-r) when 2r + 1 <= n <= 3r. Some lower bounds for different types of minimum ranks of Kneser graphs are also obtained along the way.
更多查看译文
关键词
Grundy domination number,Grundy total domination number,Kneser graph,zero forcing number,minimum rank
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要