login
A264684
Number of simple Hamiltonian graphs on n nodes which do not satisfy the Ore criterion for Hamiltonicity.
0
0, 0, 0, 0, 3, 27, 315, 5693, 172141, 9176757
OFFSET
1,5
COMMENTS
Using the "vacuous truth" convention so that complete graphs K_n are considered to be Ore graphs.
LINKS
Eric Weisstein's World of Mathematics, Ore Graph
CROSSREFS
Cf. A264683 (number of simple graphs which satisfy the Ore criterion for Hamiltonicity).
Cf. A003216 (number of simple Hamiltonian graphs).
Sequence in context: A378686 A364965 A078532 * A376529 A217363 A234462
KEYWORD
nonn,more
AUTHOR
Eric W. Weisstein, Dec 03 2015
STATUS
approved