On ``The matching polynomial of a polygraph'' (Q689958)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On ``The matching polynomial of a polygraph |
scientific article; zbMATH DE number 446804
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On ``The matching polynomial of a polygraph'' |
scientific article; zbMATH DE number 446804 |
Statements
On ``The matching polynomial of a polygraph'' (English)
0 references
16 January 1994
0 references
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.
0 references
matching polynomial
0 references
polygraph
0 references
recurrence relations
0 references
0.8912402391433716
0 references
0.8261973857879639
0 references
0.8084608316421509
0 references
