Abstract

In [6], [8] and [10], the authors studied the generalized Fibonacci numbers. Also, in [7], the author found a class of bipartite graphs whose number of $1$-factors is the $n$th $k$-Lucas numbers. In this paper, we give a new relationship between $g_n^{(k)}$ and $l_n^{(k)}$ and the number of $1$-factors of a bipartite graph.

Full Text
Paper version not known

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

Disclaimer: 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.