Distinguishing numbers of Cartesian products of multiple complete graphs
DOI:
https://doi.org/10.26493/1855-3974.245.348Abstract
We examine the distinguishing number of the Cartesian product of an arbitrary number of complete graphs. We show that for u1 ≤ ... ≤ ud the distinguishing number of the Cartesian product of complete graphs of these sizes is either ⌈ud1/s⌉ or ⌈ud1/s⌉ + 1 where s = Πi = 1d − 1 ui. In most cases, which of these values it is can be explicitly determined.Downloads
Published
2011-12-31
Issue
Section
Articles
License
Articles in this journal are published under Creative Commons Attribution 4.0 International License
https://creativecommons.org/licenses/by/4.0/