Distance-Preserving Subgraphs of Johnson Graphs
- 98 Downloads
We give a characterization of distance-preserving subgraphs of Johnson graphs, i.e., of graphs which are isometrically embeddable into Johnson graphs (the Johnson graph J(m,∧) has the subsets of cardinality m of a set ∧ as the vertex-set and two such sets A,B are adjacent iff |AΔB|=2). Our characterization is similar to the characterization of D. Ž. Djoković  of distance-preserving subgraphs of hypercubes and provides an explicit description of the wallspace (split system) defining the embedding.
Mathematics Subject Classification (2000)05C12 52B40
Unable to display preview. Download preview PDF.
- H.-J. Bandelt, V. Chepoi and K. Knauer: COMs: complexes of oriented matroids, arXiv:1507.06111, 2015.Google Scholar
- A. Björner, M. Las Vergnas, B. Sturmfels, N. White and G. Ziegler: Ori-ented Matroids, Encyclopedia of Mathematics and its Applications, vol. 46, Cambridge University Press, Cambridge, 1993.Google Scholar