|
|
A193352
|
|
Total counts of distinct (directed) Hamiltonian paths for all simple graphs of order n.
|
|
4
|
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
CROSSREFS
|
Cf. A124964 (total count of directed Hamiltonian cycles for simple graphs on n nodes).
Cf. A234601 (total count of undirected cycles for simple graphs on n nodes).
|
|
KEYWORD
|
nonn,hard,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|