Isometric embeddings in Hamming graphs

DOI10.1016/0095-8956(90)90073-9zbMath0657.05023OpenAlexW1980124329MaRDI QIDQ1110526

Elke Wilkeit

Publication date: 1990

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(90)90073-9

zbMATH Keywords

algorithmhypercubeembeddingHamming graphCartesian productisometric subgraphgated subgraph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (29)

Faster isometric embedding in products of complete graphs ⋮ Recognizing Hamming graphs in linear time and space ⋮ Topes of oriented matroids and related structures ⋮ Tiled partial cubes ⋮ On the natural imprint function of a graph ⋮ Clique-gated graphs ⋮ A characterization of cube-hypergraphs ⋮ Wiener number of vertex-weighted graphs and a chemical application ⋮ Hamming polynomials and their partial derivatives ⋮ A Helly theorem in weakly modular space ⋮ Recognizing binary Hamming graphs inO(n 2 logn) time ⋮ On partial cubes, well-graded families and their duals with some applications in graphs ⋮ On a symmetric representation of Hermitian matrices and its applications to graph theory ⋮ Quasi-median graphs, their generalizations, and tree-like equalities ⋮ Isometric embeddings of subdivided wheels in hypercubes ⋮ Factorization and pseudofactorization of weighted graphs ⋮ First-order logic axiomatization of metric graph theory ⋮ Isometric Hamming embeddings of weighted graphs ⋮ Tree-like partial Hamming graphs ⋮ Omega Polynomial in Nanostructures ⋮ Distance-preserving subgraphs of Johnson graphs ⋮ The retracts of Hamming graphs ⋮ Partial cubes: Structures, characterizations, and constructions ⋮ Strong products of \(\chi\)-critical graphs ⋮ Subdivided graphs as isometric subgraphs of Hamming graphs ⋮ Cage-amalgamation graphs, a common generalization of chordal and median graphs ⋮ Graphs S(n, k) and a Variant of the Tower of Hanoi Problem ⋮ On the canonical metric representation, average distance, and partial Hamming graphs ⋮ The number of edges in a subgraph of a Hamming graph

Cites Work

• Isometric embedding in products of complete graphs
• Gated sets in metric spaces
• On connectivity of triangulations of manifolds
• The retracts of Hamming graphs
• On cubical graphs
• Distance-preserving subgraphs of hypercubes
• Ternary spaces, media, and Chebyshev sets
• On Isometric Embeddings of Graphs
• Graphs with intrinsic s3 convexities
• Hypermetric Spaces and the Hamming Cone
• On the Addressing Problem for Loop Switching
• On cliques in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Isometric embeddings in Hamming graphs