

A268283


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


8




OFFSET

1,1


COMMENTS

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


LINKS

Table of n, a(n) for n=1..5.
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).
Sequence in context: A263587 A085611 A122608 * A196992 A321839 A192029
Adjacent sequences: A268280 A268281 A268282 * A268284 A268285 A268286


KEYWORD

nonn,fini,full


AUTHOR

Melvin Peralta, Jan 29 2016


STATUS

approved



