IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v18y2009i3d10.1007_s10878-009-9228-7.html
   My bibliography  Save this article

Fibonacci index and stability number of graphs: a polyhedral study

Author

Listed:
  • Véronique Bruyère

    (Université de Mons-Hainaut)

  • Hadrien Mélot

    (Université de Mons-Hainaut)

Abstract

The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the stability number and the order of general graphs and connected graphs. Turán graphs frequently appear in extremal graph theory. We show that Turán graphs and a connected variant of them are also extremal for these particular problems. We also make a polyhedral study by establishing all the optimal linear inequalities for the stability number and the Fibonacci index, inside the classes of general and connected graphs of order n.

Suggested Citation

  • Véronique Bruyère & Hadrien Mélot, 2009. "Fibonacci index and stability number of graphs: a polyhedral study," Journal of Combinatorial Optimization, Springer, vol. 18(3), pages 207-228, October.
  • Handle: RePEc:spr:jcomop:v:18:y:2009:i:3:d:10.1007_s10878-009-9228-7
    DOI: 10.1007/s10878-009-9228-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-009-9228-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-009-9228-7?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.

    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:jcomop:v:18:y:2009:i:3:d:10.1007_s10878-009-9228-7. 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.