Bounds on the stability number of a graph via the inverse theta function

DOI10.14232/ACTACYB.22.4.2016.5zbMATH Open1374.05217OpenAlexW2557509087MaRDI QIDQ2973236FDOQ2973236

Authors: Miklós Ujvári 

Publication date: 31 March 2017

Published in: Acta Cybernetica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.14232/actacyb.22.4.2016.5

Recommendations

• Applications of the Inverse Theta Number in Stable Set Problems
• Lower bounds on the stability number of graphs computed in terms of degrees
• An SDP-based approach for computing the stability number of a graph
• Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
• A Convex Quadratic Characterization of the Lovász Theta Number

zbMATH Keywords

stability numberinverse theta number

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Cited In (5)

• Lower bounds on the stability number of graphs computed in terms of degrees
• Applications of the Inverse Theta Number in Stable Set Problems
• Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
• Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials
• Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming

This page was built for publication: Bounds on the stability number of a graph via the inverse theta function

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2973236)