Aztec diamonds, checkerboard graphs, and spanning trees (Q1361460)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Aztec diamonds, checkerboard graphs, and spanning trees |
scientific article; zbMATH DE number 1038958
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Aztec diamonds, checkerboard graphs, and spanning trees |
scientific article; zbMATH DE number 1038958 |
Statements
Aztec diamonds, checkerboard graphs, and spanning trees (English)
0 references
25 November 1997
0 references
The characteristic polynomial of a graph that represents nonjump moves is a generalized game of checkers (that is, the \(n\times m\) game of checkers). The number of spanning trees is also determined, in particular proving a conjecture of R. P. Stanley.
0 references
Aztec diamonds
0 references
checkerboard graphs
0 references
characteristic polynomial
0 references
generalized game of checkers
0 references
spanning trees
0 references
0.770331859588623
0 references
0.7665101289749146
0 references
0.7363488674163818
0 references
0.715281069278717
0 references
