Please use this identifier to cite or link to this item:
|Title:||Spectral upper bounds on the size of k-regular induced subgraphs|
programming involving graphs
|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.|
|Appears in Collections:||MAT - Artigos|
Files in This Item:
|CardosoPinheiro2009.pdf||Electronic Version||232.42 kB||Adobe PDF||Request a copy|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.