A mapping α:V(G)→V(H) from the vertex set of one graph G to another H is an isometric embedding if shortest path distance between any two vertices in equals their images H. Here, we consider embeddings a weighted into unweighted Hamming graphs, called embeddings, when satisfies property that every edge its endpoints. Using Cartesian product decomposition canonical representation, show may be pa...
