Spanning Trees in Grid Graphs

Author name not available (Why is that?)

Publication date: 15 September 2008

Abstract: 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.

This page was built for publication: Spanning Trees in Grid Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6210896)