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

DOI10.1016/J.AML.2010.12.001MaRDI QIDQ628262zbMATH OpenOpenAlexFDO

Authors Meirun Chen, Xiaofeng Guo, Shaohui 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)

Recommendations

• The diameter of strong orientations of Cartesian products of graphs
• The strong distance problem on the Cartesian product of graphs
• Lower and upper orientable strong radius and strong diameter of the Cartesian product of complete graphs.
• The diameter of strong orientations of strong products of graphs
• Wide diameters of Cartesian product graphs and digraphs
• On the strong metric dimension of Cartesian and direct products of graphs
• The diameter variability of the Cartesian product of graphs
• The partition dimension of strong product graphs and Cartesian product graphs
• On the strong metric dimension of product graphs
• On the strong metric dimension of the strong products of graphs

Cites work

• scientific article; zbMATH DE number 1550912 (Why is no real title available?)
• scientific article; zbMATH DE number 1416462 (Why is no real title available?)
• Graph theory
• Lower and upper orientable strong diameters of graphs satisfying the Ore condition
• 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.
• On connectivity of the cartesian product of two graphs
• On optimal orientations of Cartesian products of even cycles
• On optimal orientations of Cartesian products of trees
• On strong distances in oriented graphs
• On the strong distance problems of pyramid networks
• Optimal orientations of products of paths and cycles
• The strong distance problem on the Cartesian product of graphs

Cited in

(5)

• The diameter of strong orientations of strong products of graphs
• The strong distance problem on the Cartesian product 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.
• The diameter of strong orientations of Cartesian products of graphs

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

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