Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem

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.

• Type: Journal
• Year: 2007
• Where: CPC
• Authors: Dalibor Froncek, Janja Jerebic, Sandi Klavzar, Petr Kovár
• Keywords: CPC 2007, Graphs K2 Kn, Strong Isometric Dimension, Strong Product