Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/4234
Title: | Spectral upper bounds for the order of a k-regular induced subgraph |
Author: | Cardoso, D.M. Rowlinson, P. |
Keywords: | Clique number Main eigenvalue Independence number Induced subgraphs Least eigenvalue Graph theory |
Issue Date: | 2010 |
Publisher: | Elsevier |
Abstract: | 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 is a rational function determined by the spectra of G and its complement. In the case k = 0 we obtain improved bounds for the independence number of various benchmark graphs. © 2010 Elsevier Inc. All rights reserved. |
Peer review: | yes |
URI: | http://hdl.handle.net/10773/4234 |
ISSN: | 0024-3795 |
Publisher Version: | http://www.sciencedirect.com/science/article/pii/S0024379510002065 |
Appears in Collections: | DMat - Artigos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
LAA10624.pdf | Versão Electrónica | 283.04 kB | Adobe PDF |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.