Spectra of some interesting combinatorial matrices related to oriented spanning trees on a directed graph

DOI10.1023/A:1022432212605zbMath0846.05057OpenAlexW2077815534MaRDI QIDQ1906249

Christos A. Athanasiadis

Publication date: 29 September 1996

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1022432212605

zbMATH Keywords

digrapheigenvaluesLaplacian eigenvaluesoriented rooted spanning trees

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Directed graphs (digraphs), tournaments (05C20)

Related Items (4)

Geometric and spectral analysis on weighted digraphs ⋮ A combinatorial proof of a formula of Biane and Chapuy ⋮ Laplacian matrices and spanning trees of tree graphs ⋮ Functions of random walks on hyperplane arrangements

Cites Work

• Alternating-sign matrices and domino tilings. I
• Matrix tree theorems
• Laplacian matrices of graphs: A survey
• A proof of the Markov chain tree theorem

This page was built for publication: Spectra of some interesting combinatorial matrices related to oriented spanning trees on a directed graph