2019/03/05 by Jia Huang, Huang, Jia · 1 citation
Computer Science · Mathematics · #05C69 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Interconnection Networks and Systems #math.CO #msc:05C69
paper · pdf · doi:10.48550/arxiv.1903.01844
14 pages
arxiv created 2019/03/05 · openalex publication_date 2019/03/05 · arxiv updated 2019/03/06 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
An integer distance digraph is the Cayley graph Γ(ℤ,S) of the additive group ℤ of all integers with respect to some finite subset S ⊆ ℤ. The domination ratio of Γ(ℤ,S) is the minimum density of a dominating set in Γ(ℤ,S). We establish some basic results on the domination ratio of Γ(ℤ,S) and precisely determine it when S=\s,t\ with s dividing t.