论文标题
给定半径i的极端总距离
Extremal total distance of graphs of given radius I
论文作者
论文摘要
1984年，Plesník确定了给定顺序和直径的最小总距离，并表征了极端图和挖掘。当与半径相比，我们证明了给定的顺序和半径的类似物。这渐近地证实了Chen等人的猜想。我们还陈述了Chen等人的猜想的类似物，并证明了这是足够大的。
In 1984, Plesník determined the minimum total distance for given order and diameter and characterized the extremal graphs and digraphs. We prove the analog for given order and radius, when the order is sufficiently large compared to the radius. This confirms asymptotically a conjecture of Chen et al. We also state an analog of the conjecture of Chen et al for digraphs and prove it for sufficiently large order.
