Answers are grounded in this paper and cite their sources.
Cartesian products of complete graphs are known as Hamming graphs. Using embeddings into Cartesian products of quotient graphs we characterize subgraphs, induced subgraphs, and isometric subgraphs of Hamming graphs. For instance, a graph G is an induced subgraph of a Hamming graph if and only if there exists a labeling of E ( G ) fulfilling the following two conditions: (i) edges of a triangle receive the same label; (ii) for any vertices u and v at distance at least two, there exist two labels which both appear on any induced u , υ‐path.
No takes yet. Share an insight, caveat, or question.
Klavžar et al. (2005) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: