Journal ArticleOPEN ACCESS

Aztec Diamonds, Checkerboard Graphs, and Spanning Trees

Journal of Algebraic Combinatorics (1997) 6(3) 253-257
DOI: 10.1023/A:1008605912200
11Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Knuth, D. E. (1997). Aztec Diamonds, Checkerboard Graphs, and Spanning Trees. Journal of Algebraic Combinatorics, 6(3), 253–257. https://doi.org/10.1023/A:1008605912200

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free