加载中…
Let denote the domination number of graph . Let and be graphs and their Cartesian product. For define and call this set a -layer of . We prove the following special case of Vizing’s conjecture. Let be a dominating set of . If there exist minimum dominating sets and of such that for every , the projection of to is contained in or , then .

生成讲解博客的中文版本

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