Approximating the maximum size of a k-regular induced subgraph by an upper bound on the co-k-plex number
Let α_{k} and α_{k} denote respectively the maximum cardinality k-regular induced subgraph and the co-k-plex number of a given graph. In this paper a convex quadratic programming upper bound on α_{k} which is also an upper bound on α_{k} will be introduced. The new bound, denoted by υ_{k}, improves...
| Main Author: | |
|---|---|
| Format: | article |
| Language: | eng |
| Published: |
2012
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10773/16473 |
| Country: | Portugal |
| Oai: | oai:ria.ua.pt:10773/16473 |