Minimizing the least eigenvalue of unbalanced signed unicyclic graphs with given girth or pendant vertices

DOI10.13001/ela.2024.7947OpenAlexW4390740031MaRDI QIDQ6198236

Dan Li, Yongang Wang, Ji Xiang Meng, Unnamed Author

Publication date: 21 February 2024

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.13001/ela.2024.7947

zbMATH Keywords

adjacency matrixleast eigenvalueunbalanced signed unicyclic graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• Combinatorial approach for computing the characteristic polynomial of a matrix
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• Signed graphs with maximal index
• Extremal spectral results related to spanning trees of signed complete graphs
• On the largest eigenvalue of signed unicyclic graphs
• Spectral characterizations of signed lollipop graphs
• Some results on the index of unicyclic graphs
• The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• On the notion of balance of a signed graph
• Maximizing the largest eigenvalues of signed unicyclic graphs