On ``The matching polynomial of a polygraph''
type: Item
instance of: scholarly article
title: On ``The matching polynomial of a polygraph''
zbMATH Open document ID: 0784.05051
DOI: 10.1016/0166-218X(93)90159-L
published in: Discrete Applied Mathematics
publication date: 1994-01-16T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 446804
zbMATH Keywords: matching polynomial
zbMATH Keywords: polygraph
zbMATH Keywords: recurrence relations
author: Hajo Broersma
author: Xueliang Li
reviewed by: H. N. V. Temperley
MaRDI profile type: Publication
cites work: The matching polynomial of a polygraph
cites work: Matchings in benzene chains
cites work: Q3708058
cites work: Q5562645
cites work: Q3708059
cites work: Q3758881
cites work: An effective algorithm for obtaining polynomials for dimer statistics. Application of operator technique on the topological index to two- and three-dimensional rectangular and torus lattices
description: scientific article; zbMATH DE number 446804