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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
