Distance monotonicity and a new characterization of Hamming graphs

Méziane Aïder, Mustapha Aouchiche

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


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 languageEnglish
Pages (from-to)207-213
Number of pages7
JournalInformation Processing Letters
Issue number6
Publication statusPublished - Dec 31 2005
Externally publishedYes


  • Distance monotonicity
  • Hamming graphs
  • Interconnection networks
  • Interval notion
  • Metric properties

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications


Dive into the research topics of 'Distance monotonicity and a new characterization of Hamming graphs'. Together they form a unique fingerprint.

Cite this