On least eigenvalues and least eigenvectors of real symmetric matrices and graphs
From MaRDI portal
Recommendations
Cites work
- A necessary and sufficient eigenvector condition for a connected graph to be bipartite
- A sharp upper bound on the maximal entry in the principal eigenvector of symmetric nonnegative matrix
- Bounds for the spectral radius of a graph when nodes are removed
- Graphs for which the least eigenvalue is minimal. I
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 1460605 (Why is no real title available?)
- On maximal entries in the principal eigenvector of graphs
- On the bounds of maximal entries in the principal eigenvector of symmetric nonnegative matrix
- Principal eigenvectors of irregular graphs
- The least eigenvalue of the complements of trees
Cited in
(5)- On a conjecture for the signless Laplacian spectral radius of cacti with given matching number
- Some results on the largest and least eigenvalues of graphs
- The evolution of compact binary star systems
- Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph
- Largest and least H-eigenvalues of symmetric tensors and hypergraphs
This page was built for publication: On least eigenvalues and least eigenvectors of real symmetric matrices and graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1938694)