Abstract
We examine the distinguishing number of the Cartesian product of an arbitrary number of complete graphs. We show that for u 1 ≤ ... ≤ u d the distinguishing number of the Cartesian product of complete graphs of these sizes is either ⌈ u d 1/ s ⌉ or ⌈ u d 1/ s ⌉ + 1 where s = Π i = 1 d − 1 u i . In most cases, which of these values it is can be explicitly determined.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
