Abstract
Hamming graphs are simply Cartesian products of complete graphs. Several characterizations of these graphs involve the notion of intervals in a graph and related topics. The notion of interval distance monotonicity has already been used in order to obtain a characterization of hypercubes. Here, we revisit this notion and use it to obtain a new characterization of Hamming graphs by performing a combination of the hypercube characterization and the interval hypercube characterization.
| Original language | English |
|---|---|
| Pages (from-to) | 207-213 |
| Number of pages | 7 |
| Journal | Information Processing Letters |
| Volume | 96 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - Dec 31 2005 |
| Externally published | Yes |
Keywords
- Distance monotonicity
- Hamming graphs
- Interconnection networks
- Interval notion
- Metric properties
ASJC Scopus subject areas
- Theoretical Computer Science
- Signal Processing
- Information Systems
- Computer Science Applications