|
|
A326205
|
|
Number of n-vertex labeled simple graphs not containing a Hamiltonian path.
|
|
8
|
|
|
1, 1, 1, 4, 30, 391, 9400, 398140, 30500696, 4161339596, 1058339281896, 515295969951016
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
A path is Hamiltonian if it passes through every vertex exactly once.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
Table[Length[Select[Subsets[Subsets[Range[n], {2}]], FindHamiltonianPath[Graph[Range[n], #]]=={}&]], {n, 0, 4}] (* Mathematica 10.2+ *)
|
|
CROSSREFS
|
The case for digraphs is A326213 (without loops) or A326216 (with loops).
Simple graphs with a Hamiltonian path are A326206.
Simple graphs without a Hamiltonian cycle are A326207.
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|