Spectral upper bounds for the order of a \(k\)-regular induced subgraph
From MaRDI portal
Publication:984870
DOI10.1016/j.laa.2010.04.029zbMath1215.05099OpenAlexW2060225290MaRDI QIDQ984870
Peter Rowlinson, Domingos Moreira Cardoso
Publication date: 20 July 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.04.029
Related Items (5)
Spectral Bounds for the k-Regular Induced Subgraph Problem ⋮ Spectral characterization of families of split graphs ⋮ Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number ⋮ The \(k\)-regular induced subgraph problem ⋮ Some new aspects of main eigenvalues of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A table of connected graphs on six vertices
- Eigenvalue bounds for independent sets
- More spectral bounds on the clique and independence numbers
- Chromatic number and the 2-rank of a graph
- Harmonic trees
- Maximum \(k\)-regular induced subgraphs
- Spectral upper bounds on the size of k-regular induced subgraphs
This page was built for publication: Spectral upper bounds for the order of a \(k\)-regular induced subgraph
