Aztec diamonds, checkerboard graphs, and spanning trees
Combinatorics
2008-02-03 v1
Abstract
This note derives the characteristic polynomial of a graph that represents nonjump moves in a generalized game of checkers. The number of spanning trees is also determined.
Cite
@article{arxiv.math/9501234,
title = {Aztec diamonds, checkerboard graphs, and spanning trees},
author = {Donald E. Knuth},
journal= {arXiv preprint arXiv:math/9501234},
year = {2008}
}