|
|
A264683
|
|
Number of simple graphs on n nodes which satisfy the Ore criterion for Hamiltonicity.
|
|
3
|
|
|
|
OFFSET
|
1,4
|
|
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
|
|
CROSSREFS
|
Cf. A264683 (number of Hamiltonian graphs not satisfying Ore's criterion).
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|