Spanning trees and recurrent configurations of a graph

DOI10.1016/j.amc.2017.06.030zbMath1426.05145OpenAlexW2735667269MaRDI QIDQ1740077

Xiaoxia Wu, Lian Zhu Zhang, Hai-Yan Chen

Publication date: 29 April 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2017.06.030

zbMATH Keywords

graphspanning treerecurrent configuration

Mathematics Subject Classification ID

Trees (05C05) Exact enumeration problems, generating functions (05A15) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Cites Work

• The critical group of a clique-inserted graph
• Sandpile groups and spanning trees of directed line graphs
• Explicit relation between the Wiener index and the edge-Wiener index of the catacondensed hexagonal systems
• Chip-firing games on directed graphs
• Chip-firing games on graphs
• The sand-pile model and Tutte polynomials
• On Steiner degree distance of trees
• Trees and matchings
• Enumeration of spanning trees of graphs with rotational symmetry
• The chip-firing game
• Self-organized critical state of sandpile automaton models
• Height probabilities in the Abelian sandpile model on the generalized finite Bethe lattice
• The Wiener and Terminal Wiener indices of trees
• The critical group from a cryptographic perspective
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Spanning trees and recurrent configurations of a graph