Fibonacci number of the tadpole graph

Joe DeMaio (Kennesaw State University)
John Jacobson (Moxie, Atlanta, Georgia, USA)

Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 2, No 2 (2014): Electronic Journal of Graph Theory and Applications

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.