Turán Graphs, Stability Number, and Fibonacci Index
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2008
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914707626000384 |
|---|---|
| author | Bruyère, Véronique Mélot, Hadrien |
| author_facet | Bruyère, Véronique Mélot, Hadrien |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_0802_3284 |
| institution | arXiv |
| publishDate | 2008 |
| record_format | arxiv |
| spellingShingle | Turán Graphs, Stability Number, and Fibonacci Index Bruyère, Véronique Mélot, Hadrien Discrete Mathematics 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. |
| title | Turán Graphs, Stability Number, and Fibonacci Index |
| topic | Discrete Mathematics |
| url | https://arxiv.org/abs/0802.3284 |