Abstract
In this paper, by means of independent sets in a graph with multiplicity assigned to each set, we introduce generalized Fibonacci–Leonardo numbers, which are the common generalization of the classical Fibonacci and Leonardo numbers. We give the Binet formula, the generating function, and we prove some identities for generalized Fibonacci–Leonardo numbers. We also define matrix generators for the introduced numbers.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
