On the cover polynomial of a digraph (Q1907103)

From MaRDI portal
Revision as of 20:36, 27 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q105723985, #quickstatements; #temporary_batch_1711565664090)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
On the cover polynomial of a digraph
scientific article

    Statements

    On the cover polynomial of a digraph (English)
    0 references
    0 references
    0 references
    5 June 1996
    0 references
    The authors give a recursive definition of what they call the cover polynomial \(C(D; x, y)\) of a directed graph \(D\). They develop several relations for this polynomial and show that although it is not exactly the directed analogue of the Tutte polynomial, it does have a number of similar properties.
    0 references
    digraph
    0 references
    cover polynomial
    0 references
    Tutte polynomial
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references