Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/4441
Title: Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number
Author: Cardoso, Domingos M.
Cvetkovic, D.
Keywords: Graph theory
Graph spectra
Line graph
Quadratic programming
Stability number
Issue Date: 2006
Publisher: Academie Serbe des Sciences et des Arts
Abstract: 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.
Peer review: yes
URI: http://hdl.handle.net/10773/4441
ISSN: 0561-7332
Publisher Version: http://www.emis.de/journals/BSANU/31/4.html
Appears in Collections:MAT - Artigos

Files in This Item:
File Description SizeFormat 
CardosoCvetkovic2006.pdfElectronic Version135.87 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.