Abstract
We have characterized in the previous chapter the graphs that can be isometrically embedded into a hypercube. The hypercube is the simplest example of a Cartesian product of graphs; indeed, the m-hypercube is nothing but (K 2)m. We consider here isometric embeddings of graphs into arbitrary Cartesian products. It turns out that every graph can be isometrically embedded in a canonical way into a Cartesian product whose factors are “irreducible”, i.e., cannot be further embedded into Cartesian products. We present two applications of this result, for finding the prime factorization of a graph, and for showing that the path metric of every bipartite graph can decomposed in a unique way as a nonnegative combination of primitive semimetrics.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Deza, M.M., Laurent, M. (1997). Isometric Embeddings of Graphs into Cartesian Products. In: Geometry of Cuts and Metrics. Algorithms and Combinatorics, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04295-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-04295-9_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04294-2
Online ISBN: 978-3-642-04295-9
eBook Packages: Springer Book Archive