Domination ratio of integer distance digraphs
classification
🧮 math.CO
keywords
mathbbgammadominationratiodistanceintegersomeadditive
read the original abstract
An integer distance digraph is the Cayley graph $\Gamma(\mathbb{Z},S)$ of the additive group $\mathbb{Z}$ of all integers with respect to some finite subset $S \subseteq \mathbb{Z}$. The domination ratio of $\Gamma(\mathbb{Z},S)$ is the minimum density of a dominating set in $\Gamma(\mathbb{Z},S)$. We establish some basic results on the domination ratio of $\Gamma(\mathbb{Z},S)$ and precisely determine it when $S=\{s,t\}$ with $s$ dividing $t$.
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.