A264683 Number of simple graphs on n nodes which satisfy the Ore criterion for Hamiltonicity.

1, 1, 1, 3, 5, 21, 68, 503, 4942, 128361

Offset: 1

Author

Eric W. Weisstein, Dec 03 2015

Keywords

• nonn
• more

Comments

Includes complete graphs K_n according to the "vacuous truth" convention that statements like "for all X in Y: P(X)" are true if Y is the empty set.

Links

• Eric Weisstein's World of Mathematics, Ore Graph
• Eric Weisstein's World of Mathematics, Ore's Theorem

Crossrefs

Cf. A264683 (number of Hamiltonian graphs not satisfying Ore's criterion).