TY: JOUR T1 - Spectral upper bounds on the size of k-regular induced subgraphs A1 - Cardoso, Domingos A1 - Pinheiro, Sofia N2 - 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. UR - https://ria.ua.pt/handle/10773/5485 Y1 - 2009 PB - Elsevier