On ``The matching polynomial of a polygraph'' (Q689958)

The matching polynomial of a polygraph is a generalization of the matching polynomial of a graph, vertices of the graph being replaced by graphs. Two results mentioned in the paper by \textit{D. Babić}, \textit{A. Graovac}, \textit{B. Mohar} and \textit{T. Pisanski} [ibid. 15, 11-24 (1986; Zbl 0646.05048)] are formally proved and several other results for the matching polynomial of a polygraph are also obtained, in particular, the order of the recurrence relations for the matching polynomial can be considerably reduced in certain cases.