Spectral upper bounds on the size of k-regular induced subgraphs
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 d...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | article |
| Language: | eng |
| Published: |
1000
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10773/4254 |
| Country: | Portugal |
| Oai: | oai:ria.ua.pt:10773/4254 |