Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684)

From MaRDI portal
Revision as of 23:53, 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
Minimum sizes of identifying codes in graphs differing by one vertex
scientific article

    Statements

    Minimum sizes of identifying codes in graphs differing by one vertex (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    2 August 2013
    0 references
    graph theory
    0 references
    twin-free graphs
    0 references
    identifiable graphs
    0 references
    identifying codes
    0 references

    Identifiers