The strong distance problem on the Cartesian product of graphs

DOI10.1016/j.ipl.2008.01.001zbMath1186.68022OpenAlexW1982725540MaRDI QIDQ963395

Chun-Ming Huang, Justie Su-Tzu Juan, I-fan Sun

Publication date: 19 April 2010

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

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

zbMATH Keywords

interconnection networksCartesian productstrong diameterstrong radiusbinary hypercubes

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

The diameter of strong orientations of Cartesian products of graphs ⋮ The optimal strong radius and optimal strong diameter of the Cartesian product graphs ⋮ On the strong distance problems of pyramid networks ⋮ Optimal orientations of strong products of paths

Cites Work

• Distance in digraphs
• On strong distances in oriented graphs
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• On the strong distance problems of pyramid networks
• A textbook of graph theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The strong distance problem on the Cartesian product of graphs