Isometric embeddings in Hamming graphs (Q1110526): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:14, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Isometric embeddings in Hamming graphs |
scientific article |
Statements
Isometric embeddings in Hamming graphs (English)
0 references
1990
0 references
An \(O(n^ 3)\)-algorithm is established which embeds a given graph isometrically into a Hamming graph (i.e., a Cartesian product of complete graphs) whenever possible, and recognizes non-embeddable graphs. From the algorithm several characterizations of the embeddable graphs are derived.
0 references
embedding
0 references
gated subgraph
0 references
hypercube
0 references
isometric subgraph
0 references
algorithm
0 references
Hamming graph
0 references
Cartesian product
0 references
