Spanning trees and recurrent configurations of a graph

Xiaoxia Wu, Lianzhu Zhang and Haiyan Chen

Applied Mathematics and Computation, 2017, vol. 314, issue C, 25-30

Abstract: A new explicit relationship between spanning trees and recurrent configurations of a graph is given by constructing subtree. Applying this relationship, we determine the total number of topplings in an avalanche. As applications, we calculate the sizes of avalanches of the Abelian sandpile model on the complete graph, the wheel and the complete bipartite graph.

Keywords: Spanning tree; Recurrent configuration; Graph (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317304435
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:314:y:2017:i:c:p:25-30

DOI: 10.1016/j.amc.2017.06.030

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().