Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092)

From MaRDI portal
Revision as of 13:37, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets
scientific article

    Statements

    Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (English)
    0 references
    0 references
    0 references
    0 references
    26 June 2013
    0 references
    identifying codes
    0 references
    dominating sets
    0 references
    digraphs
    0 references
    infinite digraphs
    0 references
    induced sets
    0 references

    Identifiers

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