Skip to main content
SpringerLink
Log in

Turán Graphs, Stability Number, and Fibonacci Index

  • Conference paper
Combinatorial Optimization and Applications (COCOA 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5165))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berge, C.: The Theory of Graphs. Dover Publications, New York (2001)

    MATH  Google Scholar 

  2. Bougard, N., Joret, G.: Turán Theorem and k-connected graphs. J. Graph Theory 58, 1–13 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  3. Brooks, R.-L.: On colouring the nodes of a network. Proc. Cambridge Philos. Soc. 37, 194–197 (1941)

    Article  MathSciNet  Google Scholar 

  4. Byskov, J.M.: Enumerating maximal independent sets with applications to graph colouring. Oper. Res. Lett. 32, 547–556 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  5. Christophe, J., Dewez, S., Doignon, J.-P., Elloumi, S., Fasbender, G., Grégoire, P., Huygens, D., Labbé, M., Mélot, H., Yaman, H.: Linear inequalities among graph invariants: using GraPHedron to uncover optimal relationships, 24 pages (Accepted for publication in Networks, 2008)

    Google Scholar 

  6. Erdös, P., Gallai, T.: On the minimal number of vertices representing the edges of a graph. Magyar Tud. Akad. Mat. Kutató Int. Közl. 6, 181–203 (1961)

    MATH  Google Scholar 

  7. GraPHedron: Reports on the study of the Fibonacci index and the stability number of graphs and connected graphs, www.graphedron.net/index.php?page=viewBib&bib=7

  8. Gutman, I., Polansky, O.E.: Mathematical Concepts in Organic Chemistry. Springer, Berlin (1986)

    MATH  Google Scholar 

  9. Heuberger, C., Wagner, S.: Maximizing the number of independent subsets over trees with bounded degree. J. Graph Theory 58, 49–68 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  10. Joret, G.: Entropy and Stability in Graphs. PhD thesis, Université Libre de Bruxelles, Belgium (2007)

    Google Scholar 

  11. Knopfmacher, A., Tichy, R.F., Wagner, S., Ziegler, V.: Graphs, partitions and Fibonacci numbers. Discrete Appl. Math. 155, 1175–1187 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  12. Li, X., Li, Z., Wang, L.: The Inverse Problems for Some Topological Indices in Combinatorial Chemistry. J. Comput. Biol. 10(1), 47–55 (2003)

    Article  Google Scholar 

  13. Li, X., Zhao, H., Gutman, I.: On the Merrifield-Simmons Index of Trees. MATCH Comm. Math. Comp. Chem. 54, 389–402 (2005)

    MATH  MathSciNet  Google Scholar 

  14. Lovász, L., Plummer, M.D.: Matching Theory. Akadémiai Kiadó. North-Holland, Budapest (1986)

    Google Scholar 

  15. Mélot, H.: Facet defining inequalities among graph invariants: the system GraPHedron. Discrete Appl. Math., 17 pages (Accepted for publication, 2007)

    Google Scholar 

  16. Merrifield, R.E., Simmons, H.E.: Topological Methods in Chemistry. Wiley, New York (1989)

    Google Scholar 

  17. Pedersen, A.S., Vestergaard, P.D.: The number of independent sets in unicyclic graphs. Discrete Appl. Math. 152, 246–256 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  18. Pedersen, A.S., Vestergaard, P.D.: Bounds on the Number of Vertex Independent Sets in a Graph. Taiwanese J. Math. 10(6), 1575–1587 (2006)

    MATH  MathSciNet  Google Scholar 

  19. Pedersen, A.S., Vestergaard, P.D.: An Upper Bound on the Number of Independent Sets in a Tree. Ars Combin. 84, 85–96 (2007)

    MathSciNet  Google Scholar 

  20. Prodinger, H., Tichy, R.F.: Fibonacci numbers of graphs. Fibonacci Quart. 20(1), 16–21 (1982)

    MATH  MathSciNet  Google Scholar 

  21. Tichy, R.F., Wagner, S.: Extremal Problems for Topological Indices in Combinatorial Chemistry. J. Comput. Biol. 12(7), 1004–1013 (2005)

    Article  Google Scholar 

  22. Turán, P.: Eine Extremalaufgabe aus der Graphentheorie. Mat. Fiz. Lapok 48, 436–452 (1941)

    MATH  MathSciNet  Google Scholar 

  23. Wagner, S.: Extremal trees with respect to Hosoya Index and Merrifield-Simmons Index. MATCH Comm. Math. Comp. Chem. 57, 221–233 (2007)

    MATH  Google Scholar 

  24. Wang, H., Hua, H.: Unicycle graphs with extremal Merrifield-Simmons Index. J. Math. Chem. 43(1), 202–209 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  25. Wang, M., Hua, H., Wang, D.: The first and second largest Merrifield-Simmons indices of trees with prescribed pendent vertices. J. Math. Chem. 43(2), 727–736 (2008)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Theoretical Computer Science, Université de Mons-Hainaut, Avenue du Champ de Mars 6, B-7000, Mons, Belgium

    Véronique Bruyère & Hadrien Mélot

Authors
  1. Véronique Bruyère
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hadrien Mélot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Boting Yang Ding-Zhu Du Cao An Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bruyère, V., Mélot, H. (2008). Turán Graphs, Stability Number, and Fibonacci Index. In: Yang, B., Du, DZ., Wang, C.A. (eds) Combinatorial Optimization and Applications. COCOA 2008. Lecture Notes in Computer Science, vol 5165. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-85097-7_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-85097-7_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-85096-0

  • Online ISBN: 978-3-540-85097-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation