Paul Raff

In one of my three main projects as a graduate student, I undertook a project to investigate the enumeration of spanning trees in grid graphs, with a focus on a usable implementation of the process. Using Mathematica, I was able to come up with an elegant process that, given any input graph G, computes all the information about the number of spanning trees of the graph G, multiplied by the path of length n. In this, I mean that my algorithm is able to compute as many initial terms necessary and provide the recurrence, allowing linear-time computation of subsequent terms. Alternatively, the generating function is provided, too.

The Mathematica code can be found by clicking here.