The matching polynomial of a polygraph (Q1103634): Difference between revisions

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.