Mean distance in a directed graph


In this paper we study the mean of the distances in a directed graph and compare the results obtained with the corresponding results for undirected graphs. We derive a formula which enables the computation of best possible upper and lower bounds for the mean of the distances in a directed graph. Finally we present a table of values of the mean distance for small graphs and directed graphs.

Similar works

Full text


Research Papers in Economics

Provided original full text link
Last time updated on 7/6/2012

This paper was published in Research Papers in Economics.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.