Proofs For Progressively Generalized Fibonacci Identities Using Maximal Independent Sets of Tree Graphs
General Mathematics
2022-05-24 v2
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.
Keywords
Cite
@article{arxiv.2205.06722,
title = {Proofs For Progressively Generalized Fibonacci Identities Using Maximal Independent Sets of Tree Graphs},
author = {Connor Oxenhorn},
journal= {arXiv preprint arXiv:2205.06722},
year = {2022}
}