scientific article; zbMATH DE number 6837061

zbMATH Open1424.05068MaRDI QIDQ3134400FDOQ3134400

Authors: R. Lakshmi, G. Rajasekaran, R. Sampathkumar 

Publication date: 9 February 2018

Title of this publication is not available (Why is that?)

Recommendations

• Lower and upper orientable strong diameters of graphs satisfying the Ore condition
• Lower and upper orientable strong radius and strong diameter of complete \(k\)-partite graphs
• Lower and upper orientable strong radius and strong diameter of the Cartesian product of complete graphs.
• A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture
• The diameter of strong orientations of strong products of graphs
• The diameter of strong orientations of Cartesian products of graphs
• Strong orientations of complete \(k\)-partite graphs achieving the strong diameter
• scientific article; zbMATH DE number 3991530
• Weak diameter and cyclic properties in oriented graphs
• Improved bound on the oriented diameter of graphs with given minimum degree

zbMATH Keywords

Cartesian productlower orientable strong diameterlower orientable strong radiuscycle vertex multiplication

Mathematics Subject Classification ID

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

Cited In (11)

• On the strong distance problems of pyramid networks
• Title not available (Why is that?)
• A new lower bound on the strong connectivity of an oriented graph. Application to diameters with a particular case related to Caccetta Häggkvist conjecture
• On strong distances in oriented graphs
• The diameter of strong orientations of strong products of graphs
• Lower and upper orientable strong radius and strong diameter of complete \(k\)-partite graphs
• Lower and upper orientable strong diameters of graphs satisfying the Ore condition
• 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.
• Title not available (Why is that?)

This page was built for publication:

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