Proofs For Progressively Generalized Fibonacci Identities Using Maximal Independent Sets of Tree Graphs
This paper generalizes a graph theoretic proof technique for a Fibonacci identity proposed by Lee Knisley Sanders, and explores characteristics of these generalized theorems ad infinitum.