Bounds for the extremal eigenvalues of gain Laplacian matrices
From MaRDI portal
Publication:2032256
DOI10.1016/j.laa.2021.05.009zbMath1465.05073arXiv2102.07560OpenAlexW3161258118MaRDI QIDQ2032256
M. Rajesh Kannan, Navish Kumar, Shivaramakrishna Pragada
Publication date: 11 June 2021
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2102.07560
Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)
Related Items
On the construction of cospectral nonisomorphic bipartite graphs ⋮ NEPS of complex unit gain graphs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spectral properties of complex unit gain graphs
- Bipartiteness and the least eigenvalue of signless Laplacian of graphs
- The smallest eigenvalue of the signless Laplacian
- Ground states of two-dimensional Ising spin glasses: fast algorithms, recent developments and a ferromagnet-spin glass mixture
- Spectra of graphs
- Oriented gain graphs, line graphs and eigenvalues
- Biased graphs. I: Bias, balance, and gains
- Maximum frustration in bipartite signed graphs
- Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs
- Computing the bipartite edge frustration of fullerene graphs
- On the determinant of the Laplacian matrix of a complex unit gain graph
- Balancedness and the least eigenvalue of Laplacian of signed graphs
- Partitioning Signed Two-Mode Networks
- Towards a spectral theory of graphs based on the signless Laplacian, I
- Vertices of Localized Imbalance in a Biased Graph
- Signed graphs for portfolio analysis in risk management
- A modeling and computational study of the frustration index in signed networks
