Minimum average distance of strong orientations of graphs

DOI10.1016/j.dam.2004.01.005zbMath1055.05042OpenAlexW1985797130MaRDI QIDQ1887055

Peter Dankelmann, Ortrud R. Oellermann, Jian Liang Wu

Publication date: 23 November 2004

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

Full work available at URL: https://doi.org/10.1016/j.dam.2004.01.005

zbMATH Keywords

boundsoriented graphsminimum average distance

Mathematics Subject Classification ID

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

Related Items (10)

On maximum Wiener index of directed grids ⋮ A proof of a conjecture on maximum Wiener index of oriented ladder graphs ⋮ Orientations of graphs with maximum Wiener index ⋮ Counterexamples to the conjecture on orientations of graphs with minimum Wiener index ⋮ Diameter of nanotori ⋮ On the Wiener index of orientations of graphs ⋮ Digraphs with large maximum Wiener index ⋮ Some remarks on Wiener index of oriented graphs ⋮ Directing Road Networks by Listing Strong Orientations ⋮ A generalization of Sperner's theorem and an application to graph orientations

Cites Work

• Distances in orientations of graphs
• Minimal oriented graphs of diameter 2
• The minimum diameter of orientations of complete multipartite graphs
• On the sum of all distances in a graph or digraph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum average distance of strong orientations of graphs