Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number
In this paper we study the conditions under which the stability number of line graphs, generalized line graphs and exceptional graphs attains a convex quadratic programming upper bound. In regular graphs this bound is reduced to the well known Hoffman bound. Some vertex subsets inducing subgraphs wi...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
2011
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10773/4441 |
| Country: | Portugal |
| Oai: | oai:ria.ua.pt:10773/4441 |