A374795 The minimum diameter of a chordal ring mixed graph with 2*n vertices.

1, 3, 3, 3, 4, 5, 5, 6, 5, 7, 7, 7, 7, 7, 9, 7, 8, 9, 9, 9, 9, 10, 9, 11, 9, 11, 11, 11, 11, 11, 11, 11, 11, 11, 13, 11, 12, 13, 13, 13, 13, 13, 13, 14, 13, 15, 13, 15, 13, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 17, 15, 16

Offset

2,2

Comments

Let N >= 2 and c(< N ) be, respectively, even and odd numbers. The chordal ring mixed graph CRM(N, c) is a mixed graph with vertex set V = Z_N (all arithmetic is modulo N ), with arcs i -> i + 1 (forming a directed cycle) and edges i ∼ i + c if i is even (and, hence, i ∼ i - c if i is odd, forming the ‘chords’).

Links

Table of n, a(n) for n=2..66.

Crossrefs

Cf. A373503.

Sequence in context: A240117 A333536 A069941 * A002036 A090903 A022878

Adjacent sequences: A374792 A374793 A374794 * A374796 A374797 A374798

Keyword

nonn

Author

Miquel A. Fiol, Jul 20 2024

Status

approved