The integer {k}-domination number of circulant graphs

DOI10.1142/S179383092050055XzbMath1457.05076arXiv1905.03388OpenAlexW3031578690MaRDI QIDQ5858164

Chia-An Liu, Yen-Jen Cheng, Hung-Lin Fu

Publication date: 9 April 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

Euclidean algorithmcirculant graphinteger linear programinteger \(\{k\}\)-domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Cites Work

• On integer domination in graphs and Vizing-like problems
• On the \(\{k\}\)-domination number of Cartesian products of graphs
• Graph products and integer domination
• The Domination Number of Grids
• Cyclic Scheduling via Integer Programs with Circular Ones
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item