The number of dominating k-sets of paths, cycles and wheels
Arocha, Jorge L. · Llano, Bernardo
Original · EN
We give a shorter proof of the recurrence relation for the domination polynomial γ(Pₙ,t) and for the number γₖ(Pₙ) of dominating k-sets of the path with n vertices. For every positive integers n and k, numbers γₖ(Pₙ) are determined solving a problem posed by S. Alikhani in CID 2015. Moreover, the numbers of dominating k-sets γₖ(Cₙ) of cycles and γₖ(Wₙ) of wheels with n vertices are computed.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.