Domination ratio of integer distance digraphs

Research output: Contribution to journalArticle

Abstract

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

Original languageEnglish (US)
Pages (from-to)104-115
Number of pages12
JournalDiscrete Applied Mathematics
Volume262
DOIs
Publication statusPublished - Jun 15 2019

    Fingerprint

Keywords

  • Cayley graph
  • Circulant graph
  • Domination ratio
  • Efficient dominating set
  • Integer distance graph

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this