Fast algorithms for computing the characteristic polynomial of threshold and chain graphs (Q2333249)

From MaRDI portal
Revision as of 05:51, 3 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Fast algorithms for computing the characteristic polynomial of threshold and chain graphs
scientific article

    Statements

    Fast algorithms for computing the characteristic polynomial of threshold and chain graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 November 2019
    0 references
    adjacency matrix
    0 references
    characteristic polynomial
    0 references
    graph divisor
    0 references
    threshold graph
    0 references
    chain graph
    0 references
    lexicographic product
    0 references

    Identifiers