Abstract

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 $K_2\,{\square}\, K_n$ is determined.

Full Text
Paper version not known

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 call