The On-Line Encyclopedia of Integer Sequences (OEIS)

A326208 revision #3

A326208

Number of Hamiltonian labeled simple graphs with n vertices.

0, 1, 0, 1, 10, 218, 10078

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,5

COMMENTS

A graph is Hamiltonian if it contains a cycle passing through every vertex exactly once.

LINKS

FORMULA

A006125(n) = a(n) + A326207(n).

MATHEMATICA

Table[Length[Select[Subsets[Subsets[Range[n], {2}]], FindHamiltonianCycle[Graph[Range[n], #]]!={}&]], {n, 0, 4}] (* Mathematica 8.0+ *)

CROSSREFS

The unlabeled version is A003216.

The directed version is A326204 (with loops) or A326219 (without loops).

Simple graphs not containing a Hamiltonian cycle are A326207.

Simple graphs containing a Hamiltonian path are A326206.

KEYWORD

nonn,more

AUTHOR

Gus Wiseman, Jun 15 2019

STATUS

editing