Matrix-tree theorem of digraphs via signless Laplacians
DOI10.1016/J.LAA.2022.10.027zbMATH Open1504.05173OpenAlexW4308065494WikidataQ122147632 ScholiaQ122147632MaRDI QIDQ2104963FDOQ2104963
Authors: Shu Li, Lu Lu, Weifang Wang, Jianfeng Wang
Publication date: 8 December 2022
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2022.10.027
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Applications of graph theory (05C90) Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Spectra of graphs
- Spanning trees in random graphs
- A Combinatorial Proof of the All Minors Matrix Tree Theorem
- Title not available (Why is that?)
- Line-digraphs, arborescences and theorems of Tutte and Knuth
- The number of spanning trees of the Bruhat graph
- A Cantor-Bernstein-type theorem for spanning trees in infinite graphs
- An analog of matrix tree theorem for signless Laplacians
- Counting spanning trees of a type of generalized Farey graphs
- An Elementary Proof of a Matrix Tree Theorem for Directed Graphs
Cited In (7)
- Forest matrices around the Laplacian matrix
- Spectra of some interesting combinatorial matrices related to oriented spanning trees on a directed graph
- Title not available (Why is that?)
- Around matrix-tree theorem
- Yet More Elementary Proof of Matrix-Tree Theorem for Signed Graphs
- Incidence structure
- More on minors of Hermitian (quasi-)Laplacian matrix of the second kind for mixed graphs
This page was built for publication: Matrix-tree theorem of digraphs via signless Laplacians
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2104963)