|
|
A326224
|
|
Number of unlabeled n-vertex digraphs (with loops) not containing a Hamiltonian path.
|
|
9
|
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
A directed path is Hamiltonian if it passes through every vertex exactly once.
|
|
LINKS
|
|
|
FORMULA
|
|
|
CROSSREFS
|
The undirected case is A283420 (without loops).
Unlabeled digraphs containing a Hamiltonian path are A326221.
Unlabeled digraphs not containing a Hamiltonian cycle are A326223.
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|