Bounds of eigenvalues of graphs
From MaRDI portal
Publication:1313968
DOI10.1016/0012-365X(93)90007-GzbMath0788.05067OpenAlexW2018429066MaRDI QIDQ1313968
Publication date: 1 March 1994
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(93)90007-g
Related Items (30)
A new upper bound for the spectral radius of graphs with girth at least 5 ⋮ On generalized inverse sum indeg index and energy of graphs ⋮ Conjectured bounds for the sum of squares of positive eigenvalues of a graph ⋮ On the spectral radius of bipartite graphs which are nearly complete ⋮ Bounds on graph eigenvalues. I ⋮ Spectral radii of graphs with given chromatic number ⋮ A note on eigenvalues of signed graphs ⋮ Eigenvalues and cycles of consecutive lengths ⋮ Two conjectured strengthenings of Turán's theorem ⋮ Improved lower bounds on the extrema of eigenvalues of graphs ⋮ The new upper bounds on the spectral radius of weighted graphs ⋮ Stability of Woodall's theorem and spectral conditions for large cycles ⋮ A spectral condition for the existence of cycles with consecutive odd lengths in non-bipartite graphs ⋮ The Randić index and signless Laplacian spectral radius of graphs ⋮ Spectral radius and Hamiltonian properties of graphs, II ⋮ A sharp upper bound on the spectral radius of weighted graphs ⋮ On spectral radius and energy of extended adjacency matrix of graphs ⋮ On maximal entries in the principal eigenvector of graphs ⋮ Extrema of graph eigenvalues ⋮ Eigenvalues of subgraphs of the cube ⋮ Upper bounds for the achromatic and coloring numbers of a graph ⋮ Sharp lower bounds on the spectral radius of uniform hypergraphs concerning degrees ⋮ Extremal graph characterization from the bounds of the spectral radius of weighted graphs ⋮ On the spectral radius and energy of the weighted adjacency matrix of a graph ⋮ The least eigenvalue of graphs with given connectivity ⋮ Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph ⋮ On Energy and Laplacian Energy of Graphs ⋮ Spectral radius and Hamiltonian properties of graphs ⋮ Some new bounds on the spectral radius of graphs ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Spektren endlicher Grafen
- Bounds on graph spectra
- On the spectral radius of (0,1)-matrices
- The kth largest eigenvalue of a tree
- Inverses of trees
- Lower bounds on the spectra of symmetric matrices with nonnegative entries
- A bound on the spectral radius of graphs
- Graph partitioning by eigenvectors
- Sharp lower bounds on the eigenvalues of trees
- Bounds on the \(k\)th eigenvalues of trees and forests
- Recent results in the theory of graph spectra
- A bound on the spectral radius of graphs with \(e\) edges
- Bounds of eigenvalues of a graph
- The largest eigenvalue of a graph: A survey
This page was built for publication: Bounds of eigenvalues of graphs
