A358960 Number of directed Hamiltonian paths of the Platonic graphs (in the order of tetrahedral, cubical, octahedral, dodecahedral, and icosahedral graph).

24, 144, 240, 3240, 75840

Offset: 1

Author

Seiichi Manyama, Dec 07 2022

Keywords

• nonn
• fini
• full

Comments

a(n)/2 is the number of undirected Hamiltonian paths of the Platonic graph corresponding to a(n).

From symmetry, a(n) is a multiple of A063723(n).

Links

• Seiichi Manyama, Python program (github)
• Eric Weisstein's World of Mathematics, Tetrahedral Graph
• Eric Weisstein's World of Mathematics, Cubical Graph
• Eric Weisstein's World of Mathematics, Octahedral Graph
• Eric Weisstein's World of Mathematics, Dodecahedral Graph
• Eric Weisstein's World of Mathematics, Icosahedral Graph

Crossrefs

Cf. A053016, A063723, A268283, A343213.