Back to Search
Start Over
Enumeration of maximum matchings in the Hanoi graphs using matching polynomials.
- Source :
- Discrete Mathematics, Algorithms & Applications; Oct2023, Vol. 15 Issue 7, p1-8, 8p
- Publication Year :
- 2023
-
Abstract
- 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]
- Subjects :
- POLYNOMIALS
MATCHING theory
Subjects
Details
- Language :
- English
- ISSN :
- 17938309
- Volume :
- 15
- Issue :
- 7
- Database :
- Complementary Index
- Journal :
- Discrete Mathematics, Algorithms & Applications
- Publication Type :
- Academic Journal
- Accession number :
- 165476437
- Full Text :
- https://doi.org/10.1142/S1793830922501609