The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements (Q1967108)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements
scientific article

    Statements

    The characteristic polynomial of a graph is reconstructible from the characteristic polynomials of its vertex-deleted subgraphs and their complements (English)
    0 references
    0 references
    12 March 2000
    0 references
    characteristic polynomial
    0 references
    graph reconstruction
    0 references

    Identifiers