Utilize este identificador para referenciar este registo:
http://hdl.handle.net/10773/4254| Título: | Spectral upper bounds on the size of k-regular induced subgraphs |
| Autor: | Cardoso, D.M. Pinheiro, S.J. |
| Palavras-chave: | 2-factors graph spectra independent sets induced matchings programming involving graphs |
| Data: | 2009 |
| Editora: | Elsevier |
| Resumo: | 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 |
| Versão do Editor: | http://www.sciencedirect.com/science/article/pii/S1571065309000031 |
| Aparece nas coleções: | DMat - Artigos |
Ficheiros deste registo:
| Ficheiro | Descrição | Tamanho | Formato | |
|---|---|---|---|---|
| CardosoPinheiro2009.pdf | Electronic Version | 232.42 kB | Adobe PDF |  |
Todos os registos no repositório estão protegidos por leis de copyright, com todos os direitos reservados.