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. Turan graphs frequently appear in extremal graph theory. We show that Turan graphs and a connected variant of them are also extremal for these particular problems.
展开▼
