Abstract
In this paper we study some properties of the generalized Fibonacci numbers and the generalized Lucas numbers. These numbers are equal to the total numbers of k-independent sets in special graphs. We give some identities for the generalized Fibonacci numbers and the generalized Lucas numbers, which can be useful also in problems of counting of k-independent sets in graphs.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
