| Nome: | Descrição: | Tamanho: | Formato: | |
|---|---|---|---|---|
| 319.82 KB | Adobe PDF |
Orientador(es)
Resumo(s)
A major difficulty in the recognition of graphs with convex quadratic
stability number is the existence of adverse subgraphs (an adverse
subgraph is a subgraph such that the smallest eigenvalue of its
adjacency matrix doesn’t change when any vertex or the neighbourhood of
any vertex is deleted). It is a challenge to find adverse graphs without
convex quadratic stability number. We present the main results about
graphs with convex quadratic stability number and conclusions about the
existence of adverse subgraphs belonging to this family in certain
classes of graphs.
Descrição
Palavras-chave
Convex optimization Combinatorial optimization
Contexto Educativo
Citação
Pacheco, Maria F.; Luz, Carlos J.; Cardoso, Domingos M. (2010). Algorithmic strategies for the recognition of graphs with convex. In 2nd International Conference on Engineering Optimization. IST, Lisboa. ISBN 978-989-96264-3-0.
Editora
Hélder Rodrigues et al