Enumeration of maximum matchings in the Hanoi graphs using matching polynomials.

In this paper, we consider Tower of Hanoi graphs and study their matching properties. Explicit system of recurrences is derived for the matching polynomials of these graphs and their appropriate truncated variants. Consequently, we obtain exact formula for the numbers of maximum matchings in Hanoi graphs using matching polynomials, which is a new approach for old one problem. [ABSTRACT FROM AUTHOR]