Fibonacci index and stability number of graphs: a polyhedral study

Article
First Online:

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. 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 n.

Keywords

Stable set Fibonacci index Merrifield-Simmons index Turán graph α-critical graph GraPHedron 
This is a preview of subscription content, log in to check access.

References

  1. Berge C (2001) The theory of graphs. Dover, New York MATHGoogle Scholar
  2. Bougard N, Joret G (2008) Turán Theorem and k-connected graphs. J Graph Theory 58:1–13 MATHCrossRefMathSciNetGoogle Scholar
  3. Brooks R-L (1941) On colouring the nodes of a network. Proc Camb Philos Soc 37:194–197 CrossRefMathSciNetGoogle Scholar
  4. Bruyère V, Mélot H (2008) Turàn graphs, stability number, and Fibonacci index. In: Combinatorial Optimization and Applications, COCOA 2008, St. John’s, Newfoundland, Canada, 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, pp 127–138 CrossRefGoogle Scholar
  5. Byskov JM (2004) Enumerating maximal independent sets with applications to graph colouring. Oper Res Lett 32:547–556 MATHCrossRefMathSciNetGoogle Scholar
  6. Christophe J, Dewez S, Doignon J-P, Elloumi S, Fasbender G, Grégoire P, Huygens D, Labbé M, Mélot H, Yaman H (2008) Linear inequalities among graph invariants: using GraPHedron to uncover optimal relationships. Networks 52:287–298 MATHCrossRefMathSciNetGoogle Scholar
  7. Erdös P, Gallai T (1961) On the minimal number of vertices representing the edges of a graph. M Tud Akad Mat Kut Intéz Közl 6:181–203 MATHGoogle Scholar
  8. Foulds LR (1992) Graph theory applications. Springer, New York MATHGoogle Scholar
  9. GraPHedron (2009) Reports on the study of the Fibonacci index and the stability number of graphs and connected graphs. URL: www.graphedron.net/index.php?page=viewBib&bib=10
  10. Gutman I, Polansky OE (1986) Mathematical concepts in organic chemistry. Springer, Berlin MATHGoogle Scholar
  11. Hedman B (1987) Another extremal problem for Turán graphs. Discrete Math 65:173–176 MATHCrossRefMathSciNetGoogle Scholar
  12. Heuberger C, Wagner S (2008) Maximizing the number of independent subsets over trees with bounded degree. J Graph Theory 58:49–68 MATHCrossRefMathSciNetGoogle Scholar
  13. Joret G (2007) Entropy and stability in graphs. PhD thesis, Université Libre de Bruxelles, Belgium Google Scholar
  14. Knopfmacher A, Tichy RF, Wagner S, Ziegler V (2007) Graphs, partitions and Fibonacci numbers. Discrete Appl Math 155:1175–1187 MATHCrossRefMathSciNetGoogle Scholar
  15. Li X, Li Z, Wang L (2003) The Inverse Problems for Some Topological Indices in Combinatorial Chemistry. J Comput Biol 10(1):47–55 CrossRefGoogle Scholar
  16. Li X, Zhao H, Gutman I (2005) On the Merrifield-Simmons Index of Trees. MATCH Commun Math Comput Chem 54:389–402 MATHMathSciNetGoogle Scholar
  17. Lovász L (1993) Combinatorial problems and exercises, 2nd edn. North-Holland, Amsterdam MATHGoogle Scholar
  18. Lovász L, Plummer MD (1986) Matching Theory. Akadémiai Kiadó–North-Holland, Budapest MATHGoogle Scholar
  19. Mélot H (2008) Facet defining inequalities among graph invariants: the system GraPHedron. Discrete Appl Math 156:1875–1891 MATHCrossRefMathSciNetGoogle Scholar
  20. Merrifield RE, Simmons HE (1989) Topological methods in chemistry. Wiley, New York Google Scholar
  21. Pedersen AS, Vestergaard PD (2005) The number of independent sets in unicyclic graphs. Discrete Appl Math 152:246–256 MATHCrossRefMathSciNetGoogle Scholar
  22. Pedersen AS, Vestergaard PD (2006) Bounds on the number of vertex independent sets in a graph. Taiwan J Math 10(6):1575–1587 MATHMathSciNetGoogle Scholar
  23. Pedersen AS, Vestergaard PD (2007) An upper bound on the number of independent sets in a tree. Ars Comb 84:85–96 MathSciNetGoogle Scholar
  24. Prodinger H, Tichy RF (1982) Fibonacci numbers of graphs. Fibonacci Q 20(1):16–21 MATHMathSciNetGoogle Scholar
  25. Tichy RF, Wagner S (2005) Extremal problems for topological indices in combinatorial chemistry. J Comput Biol 12(7):1004–1013 CrossRefGoogle Scholar
  26. Turán P (1941) Eine Extremalaufgabe aus der Graphentheorie. Mat Fiz Lapok 48:436–452 MATHMathSciNetGoogle Scholar
  27. Wagner S (2007) Extremal trees with respect to Hosoya Index and Merrifield-Simmons Index. MATCH Commun Math Comput Chem 57:221–233 MATHMathSciNetGoogle Scholar
  28. Wang H, Hua H (2008) Unicycle graphs with extremal Merrifield-Simmons Index. J Math Chem 43(1):202–209 MATHCrossRefMathSciNetGoogle Scholar
  29. Wang M, Hua H, Wang D (2008) The first and second largest Merrifield-Simmons indices of trees with prescribed pendent vertices. J Math Chem 43(2):727–736 MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  1. 1.Department of Theoretical Computer ScienceUniversité de Mons-HainautMonsBelgium

Personalised recommendations