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 K2□ Kn is determined.
Original language | English (US) |
---|---|
Pages (from-to) | 271-275 |
Number of pages | 5 |
Journal | Combinatorics Probability and Computing |
Volume | 16 |
Issue number | 2 |
DOIs | |
State | Published - Mar 2007 |
Bibliographical note
Funding 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.