OFFSET
1,6
COMMENTS
Every diameter k>0 occurs 4*k times.
See A370461 for the directed case.
LINKS
R. Beivide, E. Herrada, J. L. Balcazar, and A. Arruabarrena, Optimal distance networks of low degree for parallel computers, IEEE Trans. Comput. 40 (1991), no. 10, 1109-1124.
FORMULA
a(n) = ceiling((sqrt(2*n-1)-1)/2).
EXAMPLE
For n=26..41 the Cayley graph Cay(n;4,5) (circulant) has diameter a(n)=4.
CROSSREFS
KEYWORD
nonn
AUTHOR
Miquel A. Fiol, Mar 19 2024
STATUS
approved