Isometric Hamming embeddings of weighted graphs

Joseph Berleant, Kristin Sheridan, Anne Condon +2

A mapping $\alpha :V(G)\to V(H)$ from the vertex set of one graph $G$ to another graph $H$ is an isometric embedding if the shortest path distance between any two vertices in $G$ equal…