Domination ratio of integer distance digraphs

DOI10.1016/J.DAM.2019.03.001MaRDI QIDQ2416423zbMATH OpenOpenAlexWikidataFDO

Authors Jia Huang

Publication date 23 May 2019

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1903.01844

zbMATH Keywords

Cayley graphcirculant graphefficient dominating setinteger distance graphdomination ratio

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

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

Recommendations

• Domination ratio of a family of integer distance digraphs with arbitrary degree
• Domination parameters and diameter of abelian Cayley graphs
• Distance domination of generalized de Bruijn and Kautz digraphs
• Independent domination number of Cayley graphs on \(\mathbb{Z}_n\)
• Dominating sets in Cayley graphs on \(Z_n\)

Cites work

• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• scientific article; zbMATH DE number 3057976 (Why is no real title available?)
• scientific article; zbMATH DE number 3058897 (Why is no real title available?)
• Domination in circulant graphs
• Efficient dominating sets in Cayley graphs.
• Efficient domination in circulant graphs
• Efficient domination in circulant graphs with two chord lengths
• On the independence ratio of distance graphs
• Subgroups as efficient dominating sets in Cayley graphs
• Tesselation of integers
• The bondage numbers and efficient dominations of vertex-transitive graphs
• Tiling the integers with translates of one finite set

Cited in

(2)

• The set of ratios of derangements to permutations in digraphs is dense in \([0,1/2]\)
• Domination ratio of a family of integer distance digraphs with arbitrary degree

This page was built for publication: Domination ratio of integer distance digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2416423)