Constructing Dominating Sets in Circulant Graphs
Combinatorics
2016-03-03 v2 Discrete Mathematics
Number Theory
Abstract
We give an efficient construction of a reasonably small dominating set in a circulant graph on notes and distinct chord lengths. This result is based on bounds on some double exponential sums. .
Cite
@article{arxiv.1602.01286,
title = {Constructing Dominating Sets in Circulant Graphs},
author = {Igor E. Shparlinski},
journal= {arXiv preprint arXiv:1602.01286},
year = {2016}
}