Spectral upper bounds for the order of a k-regular induced subgraph

DOI10.1016/J.LAA.2010.04.029MaRDI QIDQ984870zbMATH OpenOpenAlexFDO

Authors P. Rowlinson, D. M. 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

zbMATH Keywords

graphclique numberindependence numberMain eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• Spectral upper bounds on the size of \(k\)-regular induced subgraphs
• Spectral Bounds for the k-Regular Induced Subgraph Problem
• Improving an upper bound on the size of \(k\)-regular induced subgraphs
• Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number
• Spectral bounds for the \(k\)-independence number of a graph

Cites work

• scientific article; zbMATH DE number 2149405 (Why is no real title available?)
• scientific article; zbMATH DE number 3324507 (Why is no real title available?)
• scientific article; zbMATH DE number 3377258 (Why is no real title available?)
• scientific article; zbMATH DE number 956839 (Why is no real title available?)
• A table of connected graphs on six vertices
• Chromatic number and the 2-rank of a graph
• Eigenspaces of graphs
• Eigenvalue bounds for independent sets
• Harmonic trees
• Maximum \(k\)-regular induced subgraphs
• More spectral bounds on the clique and independence numbers
• Spectral upper bounds on the size of \(k\)-regular induced subgraphs
• The main eigenvalues of a graph: a survey

Cited in

(8)

• Improving an upper bound on the size of \(k\)-regular induced subgraphs
• Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number
• Some new aspects of main eigenvalues of graphs
• The k-regular induced subgraph problem
• Bounds for regular induced subgraphs of strongly regular graphs
• Spectral upper bounds on the size of \(k\)-regular induced subgraphs
• Spectral Bounds for the k-Regular Induced Subgraph Problem
• Spectral characterization of families of split graphs

This page was built for publication: Spectral upper bounds for the order of a \(k\)-regular induced subgraph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q984870)