The integer {k}-domination number of circulant graphs

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

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

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 algorithm; circulant graph; integer linear program; integer \(\{k\}\)-domination number

Mathematics Subject Classification ID

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

11A05: Multiplicative structure; Euclidean algorithm; greatest common divisors