A385523 Numbers that are not cycle counts of inseparable graphs.

2, 4, 5, 8, 9, 16

Offset

1,1

Comments

Since subdividing edges does not change the inseparability or the cycle count, the sequence holds equally for simple graphs and multigraphs.

Links

Table of n, a(n) for n=1..6.

Ryan McCulloch, Brendan D. McKay, Alireza Salahshoori, and Thomas Zaslavsky, The Cycle Counts of Graphs, Graphs and Combinatorics 42:53, (2026). See p. 2; arXiv:2507.02260 [math.CO], 2025.

Crossrefs

Cf. A385524 (cubic graphs).

Sequence in context: A195364 A279793 A305076 * A332223 A269361 A200947

Adjacent sequences: A385520 A385521 A385522 * A385524 A385525 A385526

Keyword

nonn,fini,full,changed

Author

Thomas Zaslavsky, Jul 01 2025

Status

approved