A Note on l1-rigid Planar Graphs

Abstract In this note we study scale embeddings of graphs into hypercubes. LetG=(V, E)be a graph anddGthe usual path metric ofG. By a hypercube we mean the edge graphHqof theq-dimensional binary cube. The path metricdHofHqis simply the Hamming distance.

[1]  M Deza,et al.  L 1 -rigid Graphs , 1994 .

[2]  Sergey V. Shpectorov,et al.  On Scale Embeddings of Graphs into Hypercubes , 1993, Eur. J. Comb..