The distinguishing number of Cartesian products of complete graphs (Q2427541)

From MaRDI portal
Revision as of 10:45, 4 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
The distinguishing number of Cartesian products of complete graphs
scientific article

    Statements

    The distinguishing number of Cartesian products of complete graphs (English)
    0 references
    0 references
    0 references
    0 references
    13 May 2008
    0 references
    distinguishing number
    0 references
    vertex labeling
    0 references
    Cartesian product
    0 references
    switching lemma
    0 references

    Identifiers