Spanning Trees in Grid Graphs

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.
Submitted to the Journal of Integer Sequences. 16 pages, 12 figures

Keywords

Combinatorics

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/169128

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/0809.2551
 http://arxiv.org/abs/0809.2551

Collections

arXiv