Ramanujan circulant graphs and the conjecture of Hardy-Littlewood and Bateman-Horn

Miki Hirano, Kohei Katata, Yoshinori Yamasaki

Published 2013-10-08, updated 2015-03-13Version 3

In this paper, we determine the bound of the valency of the odd circulant graph which guarantees to be a Ramanujan graph for each fixed number of vertices. In almost of the cases, the bound coincides with the trivial bound, which comes from the trivial estimate of the largest non-trivial eigenvalue of the circulant graph. As exceptional cases, the bound in fact exceeds the trivial one by two. We then prove that such exceptionals occur only in the cases where the number of vertices has at most two prime factors and is represented by a quadratic polynomial in a finite family and, moreover, under the conjecture of Hardy-Littlewood and Bateman-Horn, exist infinitely many.