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

From MaRDI portal
ReferenceBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
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
    0 references
    0 references
    0 references
    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

    Identifiers