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

6, 12, 32, 60, 2560

Offset: 1

Author

Melvin Peralta, Jan 29 2016

Keywords

• nonn
• fini
• full

Comments

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

Links

• 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. A052762 (tetrahedral graph), A140986 (cubical graph), A115400 (octahedral graph), A218513 (dodecahedral graph), A218514 (icosahedral graph).