pith. sign in

arxiv: 1601.01268 · v1 · pith:LJS4WD3Tnew · submitted 2016-01-06 · 🧮 math.CO

The number of dominating k-sets of paths, cycles and wheels

classification 🧮 math.CO
keywords gammadominatingsetscyclesnumbernumbersverticeswheels
0
0 comments X
read the original abstract

We give a shorter proof of the recurrence relation for the domination polynomial $\gamma (P_{n},t)$ and for the number $\gamma _{k}(P_{n})$ of dominating $k$-sets of the path with $n$ vertices. For every positive integers $n$ and $k,$ numbers $\gamma _{k}(P_{n})$ are determined solving a problem posed by S. Alikhani in CID 2015. Moreover, the numbers of dominating $k$-sets $\gamma _{k}(C_{n})$ of cycles and $\gamma _{k}(W_{n})$ of wheels with $n$ vertices are computed.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.