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

Let G be a simple graph with least eigenvalue λ and let S be a set of vertices in G which induce a subgraph with mean degree k. We use a quadratic programming technique in conjunction with the main angles of G to establish an upper bound of the form | S | ≤ inf {(k + t) qG (t) : t > - λ} where qG...

Full description

Bibliographic Details
Main Author: Cardoso, D.M. (author)
Other Authors: Rowlinson, P. (author)
Format: article
Language:eng
Published: 1000
Subjects:
Clique number
Main eigenvalue
Independence number
Induced subgraphs
Least eigenvalue
Graph theory
Online Access:http://hdl.handle.net/10773/4234
Country:Portugal
Oai:oai:ria.ua.pt:10773/4234

Internet

http://hdl.handle.net/10773/4234

Similar Items