Please use this identifier to cite or link to this item:
http://hdl.handle.net/10773/27479
Title: | A survey on graphs with convex quadratic stability number |
Author: | Cardoso, Domingos M. |
Keywords: | Convex quadratic programming in graphs Stability number of graphs Relations between continuous and discrete optimization |
Issue Date: | Jan-2020 |
Publisher: | Taylors & Fancis |
Abstract: | A graph with convex quadratic stability number is a graph for which the stability number is determined by solving a convex quadratic program. Since the very beginning, where a convex quadratic programming upper bound on the stability number was introduced, a necessary and sufficient condition for this upper bound be attained was deduced. The recognition of graphs with convex quadratic stability number has been deeply studied with several consequences from continuous and combinatorial point of view. This survey starts with an exposition of some extensions of the classical Motzkin-Straus approach to the determination of the stability number of a graph and its relations with the convex quadratic programming upper bound. The main advances, including several properties and alternative characterizations of graphs with convex quadratic stability number are described as well as the algorithmic strategies developed for their recognition. Open problems and a conjecture for a particular class of graphs, herein called adverse graphs, are presented, pointing out a research line which is a challenge between continuous and discrete problems. |
Peer review: | yes |
URI: | http://hdl.handle.net/10773/27479 |
DOI: | 10.1080/02331934.2018.1526282 |
ISSN: | 0233-1934 |
Publisher Version: | https://www.tandfonline.com/doi/full/10.1080/02331934.2018.1526282 |
Appears in Collections: | CIDMA - Artigos DMat - Artigos OGTCG - Artigos |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
A survey on graphs with convex quadratic stability number.pdf | 1.62 MB | Adobe PDF |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.