Please use this identifier to cite or link to this item: http://hdl.handle.net/10198/4962
Title: Algorithmic strategies for the recognition of graphs with convex
Author: Pacheco, Maria F.
Luz, Carlos J.
Cardoso, Domingos M.
Keywords: Convex optimization
Combinatorial optimization
Issue Date: 2010
Publisher: Hélder Rodrigues et al
Citation: 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.
Abstract: 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.
URI: http://hdl.handle.net/10198/4962
ISBN: 978-989-96264-3-0
Appears in Collections:DEMAT - Resumos em Proceedings Não Indexados ao ISI/Scopus

Files in This Item:
File Description SizeFormat 
ENGOPT 2010 abstract.pdf319,82 kBAdobe PDFView/Open


FacebookTwitterDeliciousLinkedInDiggGoogle BookmarksMySpace
Formato BibTex MendeleyEndnote Degois 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.