Spanning Trees in Grid Graphs
| dc.creator | Raff, Paul | |
| dc.date | 2008-09-15 | |
| dc.date.accessioned | 2026-07-07T10:02:52Z | |
| dc.date.available | 2026-07-07T10:02:52Z | |
| dc.description | Building on work by Desjarlais, Molina, Faase, and others, a general method is obtained for counting the number of spanning trees of graphs that are a product of an arbitrary graph and either a path or a cycle, of which grid graphs are a subclass. Results are obtained pertaining to recurrences obtained in this manner, and numerous new integer sequences are found. | |
| dc.description | Submitted to the Journal of Integer Sequences. 16 pages, 12 figures | |
| dc.identifier | https://arxiv.org/abs/0809.2551 | |
| dc.identifier | http://arxiv.org/abs/0809.2551 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/169128 | |
| dc.subject | Combinatorics | |
| dc.title | Spanning Trees in Grid Graphs | |
| dc.type | text |