The optimal strong radius and optimal strong diameter of the Cartesian product graphs

DOI10.1016/j.aml.2010.12.001zbMath1209.05204OpenAlexW1985394873MaRDI QIDQ628262

Meirun Chen, Xiaofeng Guo, Shao-hui Zhai

Publication date: 10 March 2011

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2010.12.001

zbMATH Keywords

Cartesian productstrong diameterstrong distanceoptimal strong diameteroptimal strong radiusstrong radius

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

The diameter of strong orientations of Cartesian products of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower and upper orientable strong diameters of graphs satisfying the Ore condition
• The strong distance problem on the Cartesian product of graphs
• On connectivity of the cartesian product of two graphs
• Optimal orientations of products of paths and cycles
• On strong distances in oriented graphs
• On the strong distance problems of pyramid networks
• On optimal orientations of Cartesian products of even cycles
• On optimal orientations of Cartesian products of trees

This page was built for publication: The optimal strong radius and optimal strong diameter of the Cartesian product graphs