Enumerating the number of $k$-matchings in successively amalgamated graphs

Abstract

In this paper, the transfer matrix technique using the $k$-matching vector is developed to compute the number of $k$-matchings in an arbitrary graph which can be constructed by successive amalgamations over sets of cardinality two. This widely extends known methods from the literature developed for computing the number of $k$-matchings in benzenoid chains, octagonal chains, cyclooctatetraene chains, and arbitrary cyclic chains. Two examples demonstrating how the present method can be applied are given, one of then being an elaborated chemical example.