The distinguishing number of Cartesian products of complete graphs
Research output: Contribution to journal › Article › Research › peer-review
Standard
The distinguishing number of Cartesian products of complete graphs. / Imrich, Wilfried.
In: European journal of combinatorics, Vol. 29, 2008, p. 922-929.
In: European journal of combinatorics, Vol. 29, 2008, p. 922-929.
Research output: Contribution to journal › Article › Research › peer-review
Harvard
Imrich, W 2008, 'The distinguishing number of Cartesian products of complete graphs', European journal of combinatorics, vol. 29, pp. 922-929.
APA
Vancouver
Author
Bibtex - Download
@article{8e9981c2f64348e8b2800406d2ba8cd7,
title = "The distinguishing number of Cartesian products of complete graphs",
author = "Wilfried Imrich",
year = "2008",
language = "English",
volume = "29",
pages = "922--929",
journal = "European journal of combinatorics",
issn = "0195-6698",
publisher = "Academic Press Inc.",
}
RIS (suitable for import to EndNote) - Download
TY - JOUR
T1 - The distinguishing number of Cartesian products of complete graphs
AU - Imrich, Wilfried
PY - 2008
Y1 - 2008
M3 - Article
VL - 29
SP - 922
EP - 929
JO - European journal of combinatorics
JF - European journal of combinatorics
SN - 0195-6698
ER -
