Abstract
Abstract In this paper, we consider the relationships between the numbers of perfect matchings (1-factors) of bipartite graphs and Pell, Mersenne and Perrin Numbers. Then we give some Maple procedures in order to calculate the numbers of perfect matchings of these bipartite 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 callMore From: Analele Universitatii "Ovidius" Constanta - Seria Matematica
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.
