Making Walks Count: From Silent Circles to Hamiltonian Cycles
arXiv:1602.01396 · doi:10.2307/j.ctt1s4773q.14
Abstract
We illustrate the application of the matrix-transfer method for a number of enumeration problems concerning the party game Silent Circles, Hamiltonian cycles in the antiprism graphs, and simple paths and cycles of a fixed length in arbitrary graphs.