Fibonacci index and stability number of graphs: a polyhedral study

Article

DOI: 10.1007/s10878-009-9228-7

Cite this article as:
Bruyère, V. & Mélot, H. J Comb Optim (2009) 18: 207. doi:10.1007/s10878-009-9228-7

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.

Keywords

Stable set Fibonacci index Merrifield-Simmons index Turán graph α-critical graph GraPHedron 

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of Theoretical Computer ScienceUniversité de Mons-HainautMonsBelgium

Personalised recommendations