login
A363362
Number of connected weakly pancyclic graphs on n unlabeled nodes.
2
1, 1, 2, 6, 21, 108, 827, 10908, 259567, 11704426
OFFSET
1,3
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.
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.
CROSSREFS
KEYWORD
nonn,more
AUTHOR
STATUS
approved