IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v31y2005i1p61-84.html
   My bibliography  Save this article

Improving an Upper Bound on the Stability Number of a Graph

Author

Listed:
  • Carlos Luz

Abstract

In previous works an upper bound on the stability number of a graph based on quadratic programming was introduced and several of its properties were given. The graphs for which this bound is attained has been known as graphs with convex-QP stability number. This paper proposes a new upper bound on the stability number whose determination is also done by quadratic programming. It is proved that the new bound improves the above mentioned bound and several computational tests asserting its interest for large graphs are presented. In addition a necessary and sufficient condition for a graph to attain the new bound is proved. As a consequence a graph with convex-QP stability number also attains the new bound. On the other hand it is shown the existence of graphs attaining the new bound that do not belong to the class of graphs with convex-QP stability number. This allows to assert that the class of graphs with convex-QP stability number is strictly included in the class of graphs that attain the introduced bound. Some conclusions and lines for future work finalize the paper. Copyright Springer Science+Business Media New York 2005

Suggested Citation

  • Carlos Luz, 2005. "Improving an Upper Bound on the Stability Number of a Graph," Journal of Global Optimization, Springer, vol. 31(1), pages 61-84, January.
    • Handle: RePEc:spr:jglopt:v:31:y:2005:i:1:p:61-84
    DOI: 10.1007/s10898-004-6536-4
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10898-004-6536-4
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10898-004-6536-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Domingos M. Cardoso & Carlos J. Luz, 2016. "A simplex like approach based on star sets for recognizing convex- $$QP$$ Q P adverse graphs," Journal of Combinatorial Optimization, Springer, vol. 31(1), pages 311-326, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jglopt:v:31:y:2005:i:1:p:61-84. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.