The distinguishing number of Cartesian products of complete graphs (Q2427541): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejc.2007.11.018 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJC.2007.11.018 / rank | |||
Normal rank | |||
Latest revision as of 13:56, 18 December 2024
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
13 May 2008
0 references
distinguishing number
0 references
vertex labeling
0 references
Cartesian product
0 references
switching lemma
0 references
