A graph G is called spectrally d-degenerate if the largest eigenvalue of each subgraph of it with maximum degree D is at most √dD. We prove that for every constant M there is a graph with minimum degree M, which is spectrally 50-degenerate. This settles a problem of Dvorák and Mohar (Spectrally degenerate graphs: Hereditary case, arXiv: 1010.3367).
All Science Journal Classification (ASJC) codes
- Geometry and Topology
- degenerate graphs
- graph eigenvalues
- spectral radius