加载中…
We give a shorter proof of the recurrence relation for the domination polynomial and for the number of dominating -sets of the path with vertices. For every positive integers and numbers are determined solving a problem posed by S. Alikhani in CID 2015. Moreover, the numbers of dominating -sets of cycles and of wheels with vertices are computed.

生成讲解博客的中文版本

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