Name
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/978-3-540-85097-7_12 | conference on combinatorial optimization and applications |
Keywords | DocType | Volume |
fibonacci index,stability number,�-critical graph.,merrifield-simmons index,chemical graph theory,particular problem,general graph,stable sets,n graph,extremal graph theory,connected graph,n graphs,turan graph,stable set,connected variant | Conference | abs/0802.3284 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
11 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Véronique Bruyère | 1 | 429 | 43.59 |
| Hadrien Melot | 2 | 95 | 14.02 |