加载中…
Let be a graph. The disjunctive domination number of is the minimum cardinality of a set such that every vertex not in is adjacent to a vertex of , or has at least two vertices in at distance from it. In this paper, we give bounds for the disjunctive domination numbers of the torus grid graphs , and determine the disjunctive domination numbers of , and .

生成讲解博客的中文版本

生成AI智能校验的中文版本