Skip to main content

Part of the book series: Springer Proceedings in Mathematics & Statistics ((PROMS,volume 64))

Abstract

The Fibonacci number of a graph, defined by Prodinger and Tichy in 1982, is the number of independent sets on the graph. The Fibonacci number of the path graph, P n , is the Fibonacci number F n+2 and the Fibonacci number of the cycle graph, C n , is the Lucas number L n . This paper combines the visual nature of graph theory with combinatorial methods to prove new identities for the Fibonacci and Lucas numbers.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Benjamin, A.T., Quinn, J.J.: Proofs That Really Count: The Art of Combinatorial Proof. The Mathematical Association of America, Washington, DC (2003)

    Google Scholar 

  2. Calkin, N.J., Wilf, H.S.: The number of independent sets in a grid graph. SIAM J. Discrete Math. 11(1), 54–60 (1998, electronic)

    Google Scholar 

  3. Engel, K.: On the Fibonacci number of an m × n lattice. Fibonacci Quart. 28(1), 72–78 (1990)

    MathSciNet  MATH  Google Scholar 

  4. Harary, F., Read, R.: Is the null graph a pointless concept? In: Graphs and Combinatorics Conference, George Washington University. Springer, New York (1973)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  6. Koshy, T.: Fibonacci and Lucas numbers with applications. Wiley, New York (2001)

    Book  MATH  Google Scholar 

  7. Nelsen, R.B.: Proofs Without Words: Exercises in Visual Thinking. The Mathematical Association of America, Washington, DC (1993)

    MATH  Google Scholar 

  8. Nelsen, R.B.: Proofs Without Words. II: More Exercises in Visual Thinking. The Mathematical Association of America, Washington, DC (2001)

    Google Scholar 

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

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Joe DeMaio .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer Science+Business Media New York

About this paper

Cite this paper

DeMaio, J., Jacobson, J. (2013). Fibonacci and Lucas Identities via Graphs. In: Rychtář, J., Gupta, S., Shivaji, R., Chhetri, M. (eds) Topics from the 8th Annual UNCG Regional Mathematics and Statistics Conference. Springer Proceedings in Mathematics & Statistics, vol 64. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-9332-7_9

Download citation

Publish with us

Policies and ethics