Please use this identifier to cite or link to this item: http://hdl.handle.net/10773/4254
Title: Spectral upper bounds on the size of k-regular induced subgraphs
Author: Cardoso, D.M.
Pinheiro, S.J.
Keywords: 2-factors
graph spectra
independent sets
induced matchings
programming involving graphs
Issue Date: 2009
Publisher: Elsevier
Abstract: Convex quadratic programming upper bounds on the size of k-regular induced subgraphs are analyzed and a necessary and sufficient condition for such upper bounds being tight is introduced. Based on this approach, new spectral upper bounds on the order of maximum size k-regular induced subgraphs are deduced. Related open problems and a few computational experiments are presented. © 2009 Elsevier B.V. All rights reserved.
Peer review: yes
URI: http://hdl.handle.net/10773/4254
ISSN: 1571-0653
Publisher Version: http://www.sciencedirect.com/science/article/pii/S1571065309000031
Appears in Collections:MAT - Artigos

Files in This Item:
File Description SizeFormat 
CardosoPinheiro2009.pdfElectronic Version232.42 kBAdobe PDF    Request a copy


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

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