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.

Full Text
Published version (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