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

  • Miklós Ujvári
    • Categories Graphs and Matroids Tags , Short URL: https://optimization-online.org/?p=12988

    In the paper we consider degree, spectral, and semide finite bounds on the stability number of a graph. The bounds are obtained via reformulations and variants of the inverse theta function, a notion recently introduced by the author in a previous work.

    Article

    Download

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