Distance monotonicity and a new characterization of Hamming graphs

DOI10.1016/j.ipl.2005.08.009zbMath1191.68458OpenAlexW1975398125MaRDI QIDQ1044739

Méziane Aïder, Mustapha Aouchiche

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.08.009

zbMATH Keywords

interconnection networksmetric propertiesHamming graphsdistance monotonicityinterval notion

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

A characterization of the interval distance monotone graphs ⋮ Some topological properties of folded Petersen graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Retracts of strong products of graphs
• Two characterizations of generalized hypercube
• Distance monotone graphs and a new characterization of hypercubes
• Distance monotonicity and a new characterization of hypercubes
• Quasi‐median graphs and algebras

This page was built for publication: Distance monotonicity and a new characterization of Hamming graphs