Abstract
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).
Original language | English (US) |
---|---|
Pages (from-to) | 1-6 |
Number of pages | 6 |
Journal | Journal of Graph Theory |
Volume | 72 |
Issue number | 1 |
DOIs | |
State | Published - Jan 2013 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Geometry and Topology
Keywords
- degenerate graphs
- graph eigenvalues
- spectral radius