The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner's theorem, the strong isometric dimension of the Hamming graphs K2□ Kn is determined.
Bibliographical noteFunding Information:
† Supported by the University of Minnesota Duluth Grant 177–1009. ‡Supported by the Ministry of Science of Slovenia under the grant Mathematics, Physics and Mechanics, Jadranska 19, 1000 Ljubljana.