Simon Grad: Enumerating $𝑘$-matchings in successively amalgamated graphs

Enumerating $𝑘$-matchings in successively amalgamated graphs

Simon Grad

Abstract: Enumerating $k$-matchings plays a central role in mathematical chemistry, where matchings encode key molecular properties such as resonance energies and topological indices. We present a transfer matrix method for efficiently computing the $k$-matching vector of graphs built by successive amalgamations over vertex sets of cardinality two. This talk is based on joint work with Sandi Klavžar.