The strong distance problem on the Cartesian product of graphs

DOI10.1016/J.IPL.2008.01.001zbMATH Open1186.68022OpenAlexW1982725540MaRDI QIDQ963395FDOQ963395

Authors Justie Su-tzu Juan, Chun-Ming Huang, 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

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

Recommendations

• The optimal strong radius and optimal strong diameter of the Cartesian product graphs
• Lower and upper orientable strong radius and diameter of Cartesian product of paths
• Lower and upper orientable strong radius and strong diameter of the Cartesian product of complete graphs.
• scientific article; zbMATH DE number 6837061
• scientific article; zbMATH DE number 6107225

Cites work

• scientific article; zbMATH DE number 3991541 (Why is no real title available?)
• scientific article; zbMATH DE number 107951 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• scientific article; zbMATH DE number 1416462 (Why is no real title available?)
• scientific article; zbMATH DE number 1439402 (Why is no real title available?)
• A textbook of graph theory
• Distance in digraphs
• On strong distances in oriented graphs
• On the strong distance problems of pyramid networks
• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey

Cited in

(8)

• 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
• Lower and upper orientable strong radius and diameter of Cartesian product of paths
• Lower and upper orientable strong radius and strong diameter of the Cartesian product of complete graphs.
• The diameter of strong orientations of Cartesian products of graphs
• scientific article; zbMATH DE number 5115622 (Why is no real title available?)
• scientific article; zbMATH DE number 1416462 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q963395)