The matching polynomial of a polygraph (Q1103634): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q1247767 |
Set OpenAlex properties. |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: H. N. V. Temperley / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An introduction to matching polynomials / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matchings in benzene chains / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3708058 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the theory of the matching polynomial / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3708059 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4154899 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3758881 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Theory of monomer-dimer systems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Domino tilings of rectangles with fixed width / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Combinatorial methods / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4170764 / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/0166-218x(86)90014-4 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2014647881 / rank | |||
Normal rank |
Latest revision as of 08:24, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The matching polynomial of a polygraph |
scientific article |
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