On average distance in tournaments and Eulerian digraphs

DOI10.1016/j.dam.2018.10.003zbMath1476.05066OpenAlexW2898449156WikidataQ129011836 ScholiaQ129011836MaRDI QIDQ2026317

Peter Dankelmann

Publication date: 19 May 2021

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

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

zbMATH Keywords

transmissiondigraphWiener indexrouting costtotal distanceaverage distance

Mathematics Subject Classification ID

Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)

Related Items (5)

Wiener index in graphs with given minimum degree and maximum degree ⋮ Wiener Index, Kirchhoff Index in Graphs with Given Girth and Maximum Degree ⋮ Extremal graphs with respect to two distance-based topological indices ⋮ On the Wiener index of orientations of graphs ⋮ On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs

Cites Work

• Orientations of graphs with maximum Wiener index
• Distance and size in digraphs
• The diameter of almost Eulerian digraphs
• Average distance in weighted graphs
• Some remarks on Wiener index of oriented graphs
• Diameter and maximum degree in Eulerian digraphs
• Radius, diameter, and minimum degree
• Computing the average distance of an interval graph
• The diameter of directed graphs
• On the total distance between nodes in tournaments
• On the sum of all distances in a graph or digraph
• Average Distance and Edge-Connectivity II
• Average Distance and Edge-Connectivity I
• Maximum diameter of regular digraphs
• Mean distance and minimum degree
• Average distance, minimum degree, and spanning trees
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On average distance in tournaments and Eulerian digraphs