login
Minimum chord of a chordal ring graph with 2*n vertices and minimal diameter.
1

%I #10 May 27 2024 15:22:39

%S 1,1,3,3,3,5,5,5,5,5,5,5,5,7,7,7,7,7,15,7,7,9,7,19,7,9,9,9,9,9,9,11,

%T 19,19,9,9,21,11,29,23,23,11,11,25,11,11,11,11,11,13,13,23,23,41,11,

%U 25,25,13,15,27,27,27,13,13,29,29,13,13,13,31,13,15,15,15,17,27,13,43,29,29,29,45,17,17,31,31,31,39

%N Minimum chord of a chordal ring graph with 2*n vertices and minimal diameter.

%C Given integers n and c (odd), the chordal ring graph CR(2*n,c) is a bipartite graph with vertex set Z_{2*n}, and edges {i,i+1}, {i,i-1}, {i,i+c} if i is odd, and {i,i-c} if i is even.

%Y Cf. A371396.

%K nonn

%O 1,3

%A _Miquel A. Fiol_, Apr 30 2024