The Cost of 2-Distinguishing Hypercubes

TL;DR

This paper determines the exact values of the cost of 2-distinguishing hypercubes for all dimensions n ≥ 4, resolving previous uncertainties and establishing recursive relationships involving a new parameter.

Contribution

It provides the first exact characterization of the cost of 2-distinguishing hypercubes, including recursive formulas and bounds, advancing understanding of graph symmetries.

Findings

For n ≥ 4, the cost ρ(Q_n) is either 1 + ⌈log₂ n⌉ or 2 + ⌈log₂ n⌉.

Exact values of ρ(Q_n) are determined for 4 ≤ n ≤ 12, all equal to 5.

Recursive relationships involving a new parameter ν_m are established to compute ρ(Q_n) for larger n.

Abstract

A graph $G$ is said to be {\it $2$-distinguishable} if there is a labeling of the vertices with two labels so that only the trivial automorphism preserves the labels. The minimum size of a label class, over all 2-distinguishing labelings, is called the {\it cost of $2$-distinguishing}, denoted by $\rho(G)$. For $n\geq 4$ the hypercubes $Q_n$ are 2-distinguishable, but the values for $\rho(Q_n)$ have been elusive, with only bounds and partial results previously known. This paper settles the question. The main result can be summarized as: for $n\geq 4$, $\rho(Q_n) \in \{1+\lceil \log_2 n \rceil, 2 + \lceil \log_2 n\rceil\}$. Exact values are be found using a recursive relationship involving a new parameter $\nu_m$, the smallest integer for which $\rho(Q_{\nu_m})=m$. The main result is\begin{gather*} 4\leq n \leq 12\Longrightarrow \rho(Q_n)=5, \text{ and } 5\leq m \leq 11 \Longrightarrow \nu_m=4; \\ \text{ for } m\geq 6, \rho(Q_n) = m \iff 2^{m-2} - \nu_{m-1} + 1 \leq n \leq 2^{m-1}-\nu_m; \\ \text{ for } n\geq 5, \nu_m = n \iff 2^{n-1} - \rho(Q_{n-1}) + 1\leq m \leq 2^{n}-\rho(Q_n).\end{gather*}