Please use this identifier to cite or link to this item:
|Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number
|Cardoso, Domingos M.
|Academie Serbe des Sciences et des Arts
|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 with regularity properties are analyzed. Based on an observation concerning the Hoffman bound a new construction of regular exceptional graphs is provided.
|Appears in Collections:
|DMat - Artigos
Files in This Item:
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.