3 citations · 3 across the 2 of their papers we have counts for
2 papers
math.CO2014
Sandpiles, spanning trees, and plane duality
Melody Chan, Darren Glass, Matthew Macauley +3
Let G be a connected, loopless multigraph. The sandpile group of G is a finite abelian group associated to G whose order is equal to the number of spanning trees in G. Holroyd et a…
math.CO2013★ 3 cited
G-parking functions and tree inversions
David Perkinson, Qiaoyu Yang, Kuai Yu
A depth-first search version of Dhar's burning algorithm is used to give a bijection between the parking functions of a graph and labeled spanning trees, relating the degree of the…