Proofs For Progressively Generalized Fibonacci Identities Using Maximal Independent Sets of Tree Graphs

2022/05/13 by Oxenhorn, Connor
#FOS: Mathematics #General Mathematics (math.GM)

paper · doi:10.48550/arxiv.2205.06722

Abstract

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.

Related

• Some Properties of Fibonacci-Sum Set-Graphs
• Properties of the Fibonacci-sum graph
• Fibonacci Numbers and Identities
• Fibonacci Identities and Graph Colorings
• Generalized Fibonacci sequences and their properties