A note on the strength of a hypercube

Abstract

As a generalization of super magic strength, the strength of a graph was introduced in [R. Ichishima, F.A. Muntaner-Batle, A. Oshima, Bounds for the strength of graphs, Austral. J. of Combin. 72(3) (2018) 492-508]. For a vertex ordering $f$ of graph $G$, the strength of $f$ is the maximum sum of the labels on any pair of adjacent vertices. The strength of $G$ is defined as the minimum strength of $f$, taken over all vertex orderings of $G$. The strength of the hypercube is unknown, but bounded. In this note, we provide an improved upper bound for the strength of a hypercube.