Fibonacci Number of the Tadpole Graph
2014
Joe Demaio, John Jacobson

Metrik

  • Eye Icon 207 kali dilihat
  • Download Icon 115 downloads
Metrics Icon 207 kali dilihat  //  115 downloads
Abstrak

In 1982, Prodinger and Tichy defined the Fibonacci number of a graph G to be the number of independent sets of the graph G. They did so since the Fibonacci number of the path graph Pn is the Fibonacci number F(n+2) and the Fibonacci number of the cycle graph Cn is the Lucas number Ln. The tadpole graph Tn,k is the graph created by concatenating Cn and Pk with an edge from any vertex of Cn to a pendant of Pk for integers n=3 and k=0. This paper establishes formulae and identities for the Fibonacci number of the tadpole graph via algebraic and combinatorial methods.

Full text
Show more arrow
 
More from this journal
Routed Planar Networks
Ideal Basis in Constructions Defined by Directed Graphs
Graphs Obtained From Collections of Blocks
🧐  Browse all from this journal

Metrik

  • Eye Icon 207 kali dilihat
  • Download Icon 115 downloads
Metrics Icon 207 kali dilihat  //  115 downloads