The number of dominating k-sets of paths, cycles and wheels
Abstract
We give a shorter proof of the recurrence relation for the domination polynomial γ (Pn,t) and for the number γ k(Pn) of dominating k-sets of the path with n vertices. For every positive integers n and k, numbers γ k(Pn) are determined solving a problem posed by S. Alikhani in CID 2015. Moreover, the numbers of dominating k-sets γ k(Cn) of cycles and γ k(Wn) of wheels with n vertices are computed.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.