Fibonacci Index and Stability Number of Graphs: a Polyhedral Study
Discrete Mathematics
2024-03-11 v1
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\'an graphs frequently appear in extremal graph theory. We show that Tur\'an 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 .
Keywords
Cite
@article{arxiv.0811.1449,
title = {Fibonacci Index and Stability Number of Graphs: a Polyhedral Study},
author = {Véronique Bruyère and Hadrien Mélot},
journal= {arXiv preprint arXiv:0811.1449},
year = {2024}
}