The matching polynomial of a polygraph (Q1103634)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4053668
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The matching polynomial of a polygraph |
scientific article; zbMATH DE number 4053668 |
Statements
The matching polynomial of a polygraph (English)
0 references
1986
0 references
A polygraph is a collection of linked subgraphs. The matching polynomial of a cyclic polygraph is obtained as the trace of a product of matrices each corresponding to one monograph. Various results are obtained as generalizations of the well-known algorithm giving the matching polynomial of a graph in terms of the matching polynomials of smaller graphs obtained by removing lines and vertices.
0 references
polygraph
0 references
matching polynomial
0 references
algorithm
0 references
0.9619256
0 references
0 references
0.8432292
0 references
0.8338528
0 references
0 references
0.8199716
0 references
0 references
0.81712604
0 references
