圈的k-距离控制多项式

k-distance domination polynomials of cycles

设图G=(V,E)是n阶简单图,C_n表示具有n个点的圈.给出了圈C_n的k-距离控制多项式的基本性质和递推公式.其次,构造了一个二元函数f(u,v),使得k-距离控制多项式的系数d_k(C_n,i)与f(u,v)展开式中项u^nv^i的系数相等.

Let G= （V, E） be a simple graph on n vertices and Cn be circles with n nodes. This paper investigates properties of k-distance domination polynomial of Cn. Also, we present a recursive formula on the k-distance domination polynomial of a cycle. Moreover, we construct a function f（u, v） such that dk（Cn, i） equals to the coefficient of u^nv^i in