On ``The matching polynomial of a polygraph'' (Q689958): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:27, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On ``The matching polynomial of a polygraph'' |
scientific article |
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
