New results for recognizing convex-QP adverse graphs
From MaRDI portal
Recommendations
Cites work
- A Convex Quadratic Characterization of the Lovász Theta Number
- A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
- A simplex like approach based on star sets for recognizing convex-QP adverse graphs
- An introduction to the theory of graph spectra
- An upper bound on the independence number of a graph computable in polynomial-time
- Geometric algorithms and combinatorial optimization
- Graphs with least eigenvalue -2 attaining a convex quadratic upper bound for the stability number
- scientific article; zbMATH DE number 2096432 (Why is no real title available?)
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- On the Shannon capacity of a graph
- The ellipsoid method and its consequences in combinatorial optimization
Cited in
(5)- scientific article; zbMATH DE number 2096432 (Why is no real title available?)
- A survey on graphs with convex quadratic stability number
- Convex quadratic programming approach
- A simplex like approach based on star sets for recognizing convex-QP adverse graphs
- On hereditary properties of the class of graphs with convex quadratic stability number
This page was built for publication: New results for recognizing convex-\(QP\) adverse graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5207738)