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

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
• scientific article; zbMATH DE number 6107225

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)

Cites Work

• Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey
• Title not available (Why is that?)
• A textbook of graph theory
• Title not available (Why is that?)
• On strong distances in oriented graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the strong distance problems of pyramid networks
• Distance in digraphs

Cited In (8)

• On the strong distance problems of pyramid networks
• Title not available (Why is that?)
• The optimal strong radius and optimal strong diameter of the Cartesian product graphs
• Optimal orientations of strong products of paths
• The diameter of strong orientations of Cartesian products of 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.
• Title not available (Why is that?)

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)