Domination ratio of a family of integer distance digraphs with arbitrary degree

DOI10.1016/J.DAM.2022.04.011zbMath1497.05206arXiv2204.02913OpenAlexW4226228704MaRDI QIDQ2142680

Jia Huang

Publication date: 27 May 2022

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

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

zbMATH Keywords

Cayley graphinteger distance graphcirculant graphefficient dominating setdomination ratiointeger tiling

Mathematics Subject Classification ID

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

Related Items (1)

Max-norm Ramsey theory

Cites Work

• Unnamed Item
• Unnamed Item
• Subgroups as efficient dominating sets in Cayley graphs
• On the independence ratio of distance graphs
• Efficient domination in circulant graphs with two chord lengths
• From rainbow to the lonely runner: A survey on coloring parameters of distances graphs
• Tesselation of integers
• Tiling the integers with translates of one finite set
• Sequences of integers with missing differences
• Efficient dominating sets in Cayley graphs.
• Efficient domination in circulant graphs
• Domination ratio of integer distance digraphs
• The bondage numbers and efficient dominations of vertex-transitive graphs
• Sets of integers with missing differences

This page was built for publication: Domination ratio of a family of integer distance digraphs with arbitrary degree