Bounding the largest eigenvalue of signed graphs
From MaRDI portal
Publication:2419037
DOI10.1016/j.laa.2019.03.011zbMath1411.05109OpenAlexW2924496266MaRDI QIDQ2419037
Publication date: 29 May 2019
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2019.03.011
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Signed and weighted graphs (05C22)
Related Items
Unbalanced signed graphs with extremal spectral radius or index ⋮ A note on a walk-based inequality for the index of a signed graph ⋮ Signed spectral Turań-type theorems ⋮ The index of signed graphs with forbidden subgraphs ⋮ Extremal results for \(C_3^-\)-free signed graphs ⋮ Main eigenvalues of real symmetric matrices with application to signed graphs ⋮ On strongly regular signed graphs ⋮ On the largest eigenvalue of signed unicyclic graphs ⋮ A group representation approach to balance of gain graphs ⋮ Integral regular net-balanced signed graphs with vertex degree at most four ⋮ Unbalanced unicyclic and bicyclic graphs with extremal spectral radius ⋮ An upper bound for the Laplacian index of a signed graph ⋮ A decomposition of signed graphs with two eigenvalues
Cites Work
- Spectral properties of complex unit gain graphs
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- Balancing signed graphs
- Perturbations in a signed graph and its index
- A new upper bound for the Laplacian spectral radius of graphs
- Edge perturbation on signed graphs with clusters: adjacency and Laplacian eigenvalues
- Balancedness and the least eigenvalue of Laplacian of signed graphs
- On the notion of balance of a signed graph
- Matrices in the Theory of Signed Simple Graphs
- Connected signed graphs of fixed order, size, and number of negative edges with maximal index
- Inequalities for Graph Eigenvalues
