A note on spectral radius and degree deviation in graphs
From MaRDI portal
Publication:2032846
DOI10.1016/j.disc.2021.112429zbMath1472.05106OpenAlexW3159823729MaRDI QIDQ2032846
Publication date: 14 June 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2021.112429
Related Items (1)
Cites Work
- Unnamed Item
- Spectra of graphs
- Eigenvalues and degree deviation in graphs
- On the spectral radius of graphs with connectivity at most \(k\)
- Large matchings from eigenvalues
- A lower bound for the spectral radius of graphs with fixed diameter
- On the first eigenvalue of bipartite graphs
- A bound on the spectral radius of graphs
- On the maximal index of graphs with a prescribed number of edges
- On the maximal index of connected graphs
- Sharp upper bounds on the spectral radius of graphs
- The spectral radius of trees on \(k\) pendant vertices
- A sharp upper bound of the spectral radius of graphs
- On the spectral radius of graphs with cut edges
- Spectral radius and degree sequence of a graph
- Bounds on graph eigenvalues. II
This page was built for publication: A note on spectral radius and degree deviation in graphs