The transmission of a graph or digraph G is the sum of all distances in G. StFict bounds on the transmission are collected and extended for several classes of graphs and digraphs. For example, in the class of 2connected or Z-edge-mnnected graphs of order n, the maximal transmission is realized only by the cycle C,. The independence of the transmission on the diameter or radius is shown. Remarks are also given about the NP-hardness of some related algorithmic problems.

No abstract

No abstract

No abstract