On the characteristic polynomial and eigenvectors in terms of the tree-like structure of a digraph

DOI10.1007/s10958-018-3854-5zbMath1394.15005OpenAlexW2804119013WikidataQ129807199 ScholiaQ129807199MaRDI QIDQ1661494

V. A. Buslov

Publication date: 16 August 2018

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-018-3854-5

zbMATH Keywords

weighted digraphtree-like structure

Mathematics Subject Classification ID

Trees (05C05) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Related Items (1)

Algorithm for sequential construction of spanning minimal directed forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hierarchy of time scales in the case of weak diffusion
• Some determinant expansions and the matrix-tree theorem
• Forest matrices around the Laplacian matrix
• On $W$-bases of directed graphs
• A Combinatorial Proof of the All Minors Matrix Tree Theorem

This page was built for publication: On the characteristic polynomial and eigenvectors in terms of the tree-like structure of a digraph