Maximizing the largest eigenvalues of signed unicyclic graphs

DOI10.1142/S1793830920500160zbMath1456.05071OpenAlexW2990329204WikidataQ126640385 ScholiaQ126640385MaRDI QIDQ5854745

Mona Souri, M. Maghasedi, F. Heydari

Publication date: 18 March 2021

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830920500160

zbMATH Keywords

largest eigenvalueunicyclic graphunbalanced graph

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Signed and weighted graphs (05C22)

Related Items (4)

Ordering signed graphs with large index ⋮ Unbalanced signed graphs with extremal spectral radius or index ⋮ Minimizing the least eigenvalue of unbalanced signed unicyclic graphs with given girth or pendant vertices ⋮ Unnamed Item

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
• Spectral characterizations of signed cycles
• On the largest eigenvalue of signed unicyclic graphs
• Spectral characterizations of signed lollipop graphs
• Indices for special classes of trees
• Some results on the index of unicyclic graphs
• Matrices in the Theory of Signed Simple Graphs
• Connected signed graphs of fixed order, size, and number of negative edges with maximal index
• On the eigenvalues of signed complete graphs

This page was built for publication: Maximizing the largest eigenvalues of signed unicyclic graphs