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.

A363362 Number of connected weakly pancyclic graphs on n unlabeled nodes.

Original entry on oeis.org

1, 1, 2, 6, 21, 108, 827, 10908, 259567, 11704426
Offset: 1

Views

Author

Pontus von Brömssen, May 29 2023

Keywords

Comments

A graph is weakly pancyclic if it contains cycles of all lengths between its girth and its circumference. Acyclic graphs are considered to be weakly pancyclic. The concept of weak pancyclicity was introduced by Brandt, Faudree, and Goddard (1998).

Links

  • Stephan Brandt, Ralph Faudree, and Wayne Goddard, Weakly pancyclic graphs, Journal of Graph Theory 27 (1998), 141-176.

Crossrefs

Cf. A001349, A286684, A363363, A363364.

Formula

a(n) = A001349(n) - A363363(n).
a(n) = A001349(n) for n <= 5, because all graphs on at most 5 nodes are weakly pancyclic.
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.