On Matching Equivalent Graphs

Two graphs are matching equivalent if they have the same matching polynomial. We prove that several infinite families of pairs of graphs are pairwise matching equivalent. We also establish some divisibility relations among matching polynomials. Furthermore, we demonstrate that the matching polynomials of certain graphs serve as a polynomial model for the Fibonacci numbers and the Lucas numbers.