English

Domination ratio of integer distance digraphs

Combinatorics 2019-03-06 v1

Abstract

An integer distance digraph is the Cayley graph Γ(Z,S)\Gamma(\mathbb{Z},S) of the additive group Z\mathbb{Z} of all integers with respect to some finite subset SZS \subseteq \mathbb{Z}. The domination ratio of Γ(Z,S)\Gamma(\mathbb{Z},S) is the minimum density of a dominating set in Γ(Z,S)\Gamma(\mathbb{Z},S). We establish some basic results on the domination ratio of Γ(Z,S)\Gamma(\mathbb{Z},S) and precisely determine it when S={s,t}S=\{s,t\} with ss dividing tt.

Keywords

Cite

@article{arxiv.1903.01844,
  title  = {Domination ratio of integer distance digraphs},
  author = {Jia Huang},
  journal= {arXiv preprint arXiv:1903.01844},
  year   = {2019}
}

Comments

14 pages

R2 v1 2026-06-23T07:58:43.080Z