On strong distances in oriented graphs

DOI10.1016/S0012-365X(02)00807-5zbMath1025.05020MaRDI QIDQ1810644

Henda C. Swart, Peter Dankelmann, David P. Day

Publication date: 9 June 2003

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

distancedirected graphstrong connectivitystrong diameterstrong distancestrong radius

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (9)

Lower and upper orientable strong diameters of graphs satisfying the Ore condition ⋮ Strongly self-centered orientation of complete \(k\)-partite graphs ⋮ The optimal strong radius and optimal strong diameter of the Cartesian product graphs ⋮ On the strong distance problems of pyramid networks ⋮ The strong distance problem on the Cartesian product of graphs ⋮ Lower and upper orientable strong radius and strong diameter of complete \(k\)-partite graphs ⋮ Strong orientations of complete \(k\)-partite graphs achieving the strong diameter ⋮ Parameterized certificate dispersal and its variants ⋮ Optimal strong \((\kappa ,d)\)-orientation of complete \(k\)-partite graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On strong distances in oriented graphs