Maximizing the largest eigenvalues of signed unicyclic graphs
From MaRDI portal
Recommendations
Cites work
- An introduction to the theory of graph spectra
- Combinatorial approach for computing the characteristic polynomial of a matrix
- Connected signed graphs of fixed order, size, and number of negative edges with maximal index
- scientific article; zbMATH DE number 740754 (Why is no real title available?)
- Indices for special classes of trees
- Matrices in the theory of signed simple graphs
- Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
- On the eigenvalues of signed complete graphs
- On the largest eigenvalue of signed unicyclic graphs
- Some results on the index of unicyclic graphs
- Spectral characterizations of signed cycles
- Spectral characterizations of signed lollipop graphs
Cited in
(12)- Largest eigenvalue of a unicyclic mixed graphs
- Unbalanced signed graphs with extremal spectral radius or index
- On the index of unbalanced signed bicyclic graphs
- On the largest eigenvalue of signed unicyclic graphs
- Unbalanced unicyclic and bicyclic graphs with extremal spectral radius.
- Ordering signed graphs with large index
- Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings
- On spectral radius of signed graphs without negative even cycles
- Signed bicyclic graphs with minimal index
- Minimizing the least eigenvalue of unbalanced signed unicyclic graphs with given girth or pendant vertices
- Some results on the complete sigraphs with exactly three non-negative eigenvalues
- A characterization of (K_n,U^-) in the class L(3)
This page was built for publication: Maximizing the largest eigenvalues of signed unicyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5854745)
