A survey on graphs with convex quadratic stability number

DOI10.1080/02331934.2018.1526282zbMath1435.90098arXiv1811.05516OpenAlexW3105185467MaRDI QIDQ5207733

Domingos Moreira Cardoso

Publication date: 13 January 2020

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.05516

zbMATH Keywords

convex quadratic programming in graphsrelations between continuous and discrete optimizationstability number of graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Quadratic programming (90C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient domination through eigenvalues
• Improving an upper bound on the stability number of a graph
• Spectra of graphs
• On hereditary properties of the class of graphs with convex quadratic stability number
• A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
• On maximal independent sets of vertices in claw-free graphs
• Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
• A surprising property of the least eigenvalue of a graph
• A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
• On standard quadratic optimization problems
• Stability in \(P_5\)- and banner-free graphs
• Equitable bipartitions of graphs and related results
• An upper bound on the independence number of a graph computable in polynomial-time
• Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number
• On the Shannon capacity of a graph
• Continuous Characterizations of the Maximum Clique Problem
• Reducibility among Combinatorial Problems
• Maxima for Graphs and a New Proof of a Theorem of Turán
• Paths, Trees, and Flowers
• A Convex Quadratic Characterization of the Lovász Theta Number
• A quadratic programming approach to the determination of an upper bound on the weighted stability number
• A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs
• A characterization of the weighted Lovász number based on convex quadratic programming

This page was built for publication: A survey on graphs with convex quadratic stability number