[en] 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
Disciplines :
Electrical & electronics engineering Mathematics
Author, co-author :
Bruyère, Véronique ; Université de Mons > Faculté des Sciences > Service d'Informatique théorique
