Laplacian matrices and spanning trees of tree graphs

DOI10.5802/afst.1532OpenAlexW1808922155MaRDI QIDQ2012073

Guillaume Chapuy, Philippe Biane

Publication date: 27 July 2017

Published in: Annales de la Faculté des Sciences de Toulouse. Mathématiques. Série VI (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1505.04806

Mathematics Subject Classification ID

Graph theory (05Cxx) PDEs on graphs and networks (ramified or polygonal spaces) (35R02)

Related Items (3)

Three conjectures of Ostrander on digraph Laplacian eigenvectors ⋮ A novel count of the spanning trees of a cube ⋮ A combinatorial proof of a formula of Biane and Chapuy

Cites Work

• Unnamed Item
• Sandpile groups and spanning trees of directed line graphs
• Factorizations of some weighted spanning tree enumerators
• A proof of the Markov chain tree theorem
• Spectra of some interesting combinatorial matrices related to oriented spanning trees on a directed graph
• On the spanning trees of the hypercube and other products of graphs
• Non-negative matrices and Markov chains.
• Polynomials Associated with Finite Markov Chains

This page was built for publication: Laplacian matrices and spanning trees of tree graphs