On coefficients of the characteristic polynomial of the Laplace matrix of a weighted digraph and the all minors theorem

DOI10.1007/s10958-016-2695-3zbMath1337.05052OpenAlexW2299387292MaRDI QIDQ291166

V. A. Buslov

Publication date: 7 June 2016

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

Full work available at URL: https://doi.org/10.1007/s10958-016-2695-3

Mathematics Subject Classification ID

Graph polynomials (05C31) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Related Items (3)

Identifiability of linear compartmental models: the singular locus ⋮ Hearing shapes viap-adic Laplacians ⋮ Algorithm for sequential construction of spanning minimal directed forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Hierarchy of time scales in the case of weak diffusion
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• 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 coefficients of the characteristic polynomial of the Laplace matrix of a weighted digraph and the all minors theorem