Abstract
An integer distance digraph is the Cayley graph of the additive group of all integers with respect to a finite subset . The domination ratio of , defined as the minimum density of its dominating sets, is related to some number theory problems, such as tiling the integers and finding the maximum density of a set of integers with missing differences. We precisely determine the domination ratio of the integer distance graph for any integers and satisfying and . Our result generalizes a previous result on the domination ratio of the graph with and also implies the domination number of certain circulant graphs , where is the finite cyclic group of integers modulo and is a subset of .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.