Sciweavers

Share
CPC
2007

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

9 years 9 months ago
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.
Dalibor Froncek, Janja Jerebic, Sandi Klavzar, Pet
Added 13 Dec 2010
Updated 13 Dec 2010
Type Journal
Year 2007
Where CPC
Authors Dalibor Froncek, Janja Jerebic, Sandi Klavzar, Petr Kovár
Comments (0)
books