The degree sequence is reconstructible from \(n-1\) cards (Q1193716)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The degree sequence is reconstructible from \(n-1\) cards
scientific article

    Statements

    The degree sequence is reconstructible from \(n-1\) cards (English)
    0 references
    27 September 1992
    0 references
    degree sequence
    0 references
    vertex-deleted subgraph
    0 references
    card
    0 references
    0 references

    Identifiers