|
%I #15 Aug 23 2023 08:35:34
%S 1,1,1,16,772
%N Number of labeled n-vertex digraphs (without loops) not containing a (directed) Hamiltonian path.
%C A path is Hamiltonian if it passes through every vertex exactly once.
%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Hamiltonian_path">Hamiltonian path</a>
%H Gus Wiseman, <a href="http://arxiv.org/abs/0709.0430">Enumeration of paths and cycles and e-coefficients of incomparability graphs</a>, arXiv:0709.0430 [math.CO], 2007.
%F A053763(n) = a(n) + A326217(n).
%e The a(3) = 16 edge-sets:
%e {} {12} {12,13}
%e {13} {12,21}
%e {21} {12,32}
%e {23} {13,23}
%e {31} {13,31}
%e {32} {21,23}
%e {21,31}
%e {23,32}
%e {31,32}
%t Table[Length[Select[Subsets[Select[Tuples[Range[n],2],UnsameQ@@#&]],FindHamiltonianPath[Graph[Range[n],DirectedEdge@@@#]]=={}&]],{n,4}] (* Mathematica 10.2+ *)
%Y Unlabeled digraphs not containing a Hamiltonian path are A326224.
%Y The undirected case is A326205.
%Y The unlabeled undirected case is A283420.
%Y The case with loops is A326213.
%Y Digraphs (without loops) containing a Hamiltonian path are A326217.
%Y Digraphs (without loops) not containing a Hamiltonian cycle are A326218.
%Y Cf. A000595, A002416, A003024, A003216, A057864, A326206, A326214, A326220, A326221, A326225.
%K nonn,more
%O 0,4
%A _Gus Wiseman_, Jun 15 2019
|
