On average distance in tournaments and Eulerian digraphs

DOI10.1016/J.DAM.2018.10.003MaRDI QIDQ2026317zbMATH OpenOpenAlexWikidataFDO

Authors 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

average distancedigraphrouting costtotal distancetransmissionWiener index

Mathematics Subject Classification ID

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

Recommendations

• Average distance in bipartite tournaments.
• Average distance in k-connected tournaments.
• Proximity and remoteness in directed and undirected graphs
• Diameter and maximum degree in Eulerian digraphs
• Distance and size in digraphs

Cites work

• Average Distance and Edge-Connectivity I
• Average Distance and Edge-Connectivity II
• Average distance in k-connected tournaments.
• Average distance in bipartite tournaments.
• Average distance in weighted graphs
• Average distance, minimum degree, and spanning trees
• Computing the average distance of an interval graph
• Diameter and maximum degree in Eulerian digraphs
• Distance and size in digraphs
• scientific article; zbMATH DE number 4144019 (Why is no real title available?)
• Maximum diameter of regular digraphs
• Mean distance and minimum degree
• On the sum of all distances in a graph or digraph
• On the total distance between nodes in tournaments
• Orientations of graphs with maximum Wiener index
• Radius, diameter, and minimum degree
• Some remarks on Wiener index of oriented graphs
• The diameter of almost Eulerian digraphs
• The diameter of directed graphs

Cited in

(10)

• Packing 4-cycles in Eulerian and bipartite Eulerian tournaments with an application to distances in interchange graphs
• Extremal graphs with respect to two distance-based topological indices
• On Wiener index and average eccentricity of graphs of girth at least 6 and \((C_4, C_5)\)-free graphs
• The average connectivity of regular multipartite tournaments
• Average distance in k-connected tournaments.
• Average distance in bipartite tournaments.
• Wiener index in graphs with given minimum degree and maximum degree
• Wiener Index, Kirchhoff Index in Graphs with Given Girth and Maximum Degree
• On the Wiener index of orientations of graphs
• The diameter of almost Eulerian digraphs

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

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