cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

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

Views

Author

Miquel A. Fiol, Jul 20 2024

Keywords

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’).

Crossrefs

Cf. A373503.
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.