Matrix-tree theorems for complex unit gain networks

DOI10.1016/J.CAM.2026.117807MaRDI QIDQ7309212zbMATH OpenFDO

Authors Shu Li, Jianfeng Wang, Matthias Dehmer, Maurizio Brunetti, Yuxia Li

Publication date 4 August 2026

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.CAM.2026.117807

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites work

• A Combinatorial Proof of the All Minors Matrix Tree Theorem
• A group representation approach to balance of gain graphs
• An analog of matrix tree theorem for signless Laplacians
• An elementary proof of a matrix tree theorem for directed graphs
• An introduction to the theory of graph spectra
• Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
• Enumeration of spanning trees of 2-separable networks
• Gain-line graphs via \(G\)-phases and group representations
• Generalized matrix tree theorem for mixed graphs
• Hermitian adjacency matrix of digraphs and mixed graphs
• Hermitian normalized Laplacian matrix for directed networks
• scientific article; zbMATH DE number 3047763 (Why is no real title available?)
• Integer symmetric matrices having all their eigenvalues in the interval \([ - 2,2]\)
• Matrices in the theory of signed simple graphs
• Matrix-tree theorem of digraphs via signless Laplacians
• More on minors of Hermitian (quasi-)Laplacian matrix of the second kind for mixed graphs
• NEPS of complex unit gain graphs
• On cospectrality of gain graphs
• On eigenspaces of some compound complex unit gain graphs
• On the determinant of the Laplacian matrix of a complex unit gain graph
• On the Laplacian coefficients of signed graphs
• On the number of spanning trees on various lattices
• Principal minor version of matrix-tree theorem for mixed graphs
• Principal Minors of Hermitian (Quasi-)Laplacian Matrix of Second Kind for Mixed Graphs
• Signed graphs, root lattices, and Coxeter groups
• Spectra of quaternion unit gain graphs
• Spectral properties of complex unit gain graphs
• The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
• Ueber eine der Interpolation entsprechende Darstellung der Eliminations-Resultante.
• Yet More Elementary Proof of Matrix-Tree Theorem for Signed Graphs

Cited in

(1)

• Asymptotic normality for the coefficients of graph polynomials

This page was built for publication: Matrix-tree theorems for complex unit gain networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7309212)