Aztec diamonds, checkerboard graphs, and spanning trees
classification
🧮 math.CO
keywords
spanningtreesazteccharacteristiccheckerboardcheckersderivesdetermined
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.