Publicação

Algorithmic strategies for the recognition of graphs with convex quadratic stability number

Ver documento

Detalhes bibliográficos
Resumo: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.
Autores principais:Pacheco, Maria F.
Outros Autores:Luz, Carlos J.; Cardoso, Domingos M.
Assunto:Convex optimization Combinatorial optimization
Ano:2010
País:Portugal
Tipo de documento:documento de conferência
Tipo de acesso:acesso aberto
Instituição associada:Instituto Politécnico de Bragança
Idioma:inglês
Origem:Biblioteca Digital do IPB
Descrição
Resumo: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.