Matching polynomials of the Sierpinski gasket graphs

Abstract

Sierpinski gasket graphs form a well-known family of graphs that are objects of study in graph theory. In this paper we present a recursive method to generate the matching polynomials of these graphs and use them to derive bounds on the growth rate of their Hosoya indices. We also point out a connection of the growth rate problem with the dynamics on the real projective space. (c) 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.