Matching polynomials: A matrix approach and its applications

Abstract

A new approach is formulated for the matching polynomial m( G) of a graph G. A matrix A( G) is associated with G. A certain function defined on A( G) yields the matching polynomial of G. This approach leads to a simple characterization of m( G). It also facilitates a technique for constructing graphs with a given matching polynomial.