Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity (Q1001641)

From MaRDI portal
Revision as of 02:52, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity
scientific article

    Statements

    Discriminating codes in bipartite graphs: Bounds, extremal cardinalities, complexity (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 February 2009
    0 references
    bipartite graphs
    0 references
    discriminating codes
    0 references
    identifying codes
    0 references
    locating-dominating codes
    0 references
    separating codes
    0 references
    complexity
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references