On average distance in tournaments and Eulerian digraphs
type: Item
instance of: scholarly article
title: On average distance in tournaments and Eulerian digraphs
zbMATH Open document ID: 1476.05066
author: Peter Dankelmann
published in: Discrete Applied Mathematics
publication date: 2021-05-19T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C12
Mathematics Subject Classification ID: 05C45
Mathematics Subject Classification ID: 05C09
zbMATH DE Number: 7349643
zbMATH Keywords: average distance
zbMATH Keywords: Wiener index
zbMATH Keywords: transmission
zbMATH Keywords: total distance
zbMATH Keywords: routing cost
zbMATH Keywords: digraph
MaRDI profile type: Publication
full work available at URL: j.dam.2018.10.003
OpenAlex ID: W2898449156
cites work: Computing the average distance of an interval graph
cites work: The diameter of directed graphs
cites work: Average distance in weighted graphs
cites work: Distance and size in digraphs
cites work: Diameter and maximum degree in Eulerian digraphs
cites work: Average distance, minimum degree, and spanning trees
cites work: Average Distance and Edge-Connectivity I
cites work: Average Distance and Edge-Connectivity II
cites work: Q3408853
cites work: Q3624976
cites work: The diameter of almost Eulerian digraphs
cites work: Radius, diameter, and minimum degree
cites work: Orientations of graphs with maximum Wiener index
cites work: Some remarks on Wiener index of oriented graphs
cites work: Q3475294
cites work: Mean distance and minimum degree
cites work: On the total distance between nodes in tournaments
cites work: On the sum of all distances in a graph or digraph
cites work: Maximum diameter of regular digraphs
Wikidata QID: Q129011836
DOI: 10.1016/J.DAM.2018.10.003
description: scientific article; zbMATH DE number 7349643