arXiv Analytics

Sign in

arXiv:math/9501234 [math.CO]AbstractReferencesReviewsResources

Aztec diamonds, checkerboard graphs, and spanning trees

Donald E. Knuth

Published 1995-01-23Version 1

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.

Journal: J. Algebraic Combin. 6 (1997), no. 3, 253--257
Categories: math.CO
Related articles: Most relevant | Search more
arXiv:1306.4649 [math.CO] (Published 2013-06-19)
On the characteristic polynomial of Laplacian Matrices of Caterpillars
arXiv:1812.09013 [math.CO] (Published 2018-12-21)
The characteristic polynomial of the hypergraphs and cospectral hypergraphs
arXiv:2310.07104 [math.CO] (Published 2023-10-11)
On the edge reconstruction of the characteristic and permanental polynomials of a simple graph

Links

Toolbox