加载中…
For any graph , a subset dominates if . The minimum cardinality over all such is called the domination number, written . The classical conjecture of V.G. Vizing states that where stands for the Cartesian product of graphs. In this paper, we apply well-known results to prove the Vizing-type inequality .

生成讲解博客的中文版本

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