The distinguishing number of the hypercube

Citations of this article
Mendeley users who have this article in their library.


The distinguishing number of a graph G is the minimum number of colors for which there exists an assignment of colors to the vertices of G so that the group of color-preserving automorphisms of G consists only of the identity. It is shown, for the d-dimensional hypercubic graphs Hd, that D(H d)=3 if d ∈ {2,3} and D(Hd)=2 if d≥4. It is also shown that D(Hd2)=4 for d ∈ {2,3} and D(H d2)=2 for d≥4, where Hd2 denotes the square of the d-dimensional hypercube. This solves the distinguishing number for hypercubic graphs and their squares. © 2004 Elsevier B.V. All rights reserved.




Bogstad, B., & Cowen, L. J. (2004). The distinguishing number of the hypercube. Discrete Mathematics, 283(1–3), 29–35.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free