DSpace
 
  Repositório Institucional da Universidade de Aveiro > Departamento de Matem├ítica > MAT - Artigos >
 Spectral upper bounds on the size of k-regular induced subgraphs
Please use this identifier to cite or link to this item http://hdl.handle.net/10773/5485

title: Spectral upper bounds on the size of k-regular induced subgraphs
authors: Cardoso, Domingos
Pinheiro, Sofia
keywords: graph spectra
independent sets
induced matchings
programming involving graphs
2-factors
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.
URI: http://hdl.handle.net/10773/5485
ISSN: 1571-0653
source: Electronic Notes in Discrete Mathematics
appears in collectionsMAT - Artigos

files in this item

file description sizeformat
SpectralUpperBounds.pdf118.15 kBAdobe PDFview/open
Restrict Access. You can Request a copy!
statistics

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

 

Valid XHTML 1.0! RCAAP OpenAIRE DeG├│is
ria-repositorio@ua.pt - Copyright ©   Universidade de Aveiro - RIA Statistics - Powered by MIT's DSpace software, Version 1.6.2