The distinguishing number of Cartesian products of complete graphs (Q2427541): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejc.2007.11.018 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081088856 / rank | |||
Normal rank | |||
Revision as of 20:53, 19 March 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
