\(\ell_ 1\)-rigid graphs

DOI10.1023/A:1022441506632zbMath0802.05066MaRDI QIDQ1321589

Monique Laurent, Michel Marie Deza

Publication date: 28 April 1994

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

zbMATH Keywords

hypercubelabellingHamming distanceJohnson graphsrigid

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items

Application of cut polyhedra. I, Recognizing halved cubes in a constant time per edge, Clin d'oeil on \(L_1\)-embeddable planar graphs, \(L_ 1\)-embeddability of rectilinear polygons with holes, \(l_1\)-embeddability under the edge-gluing operation on graphs, \(l_1\)-embeddability of shifted quadrilateral cylinder graphs, Isometric Hamming embeddings of weighted graphs, Extension operations for cuts, \(l_1\)-embeddability of generic quadrilateral Möbius maps, Decomposition and \(l_1\)-embedding of weakly median graphs, Fullerenes and coordination polyhedra versus half-cube embeddings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Distance regular subgraphs of a cube
• Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
• Collapse of the metric hierarchy for bipartite graphs
• Rigid pentagons in hypercubes
• Extension operations for cuts
• Facets for the cut cone. I
• On scale embeddings of graphs into hypercubes
• Recent results in the theory of graph spectra
• Applications of cut polyhedra. II
• Distance-preserving subgraphs of hypercubes
• Metrics and undirected cuts
• On Isometric Embeddings of Graphs
• HYPERMETRIC GRAPHS
• Addresses for graphs