关于图平均距离猜想的一类反例

A Kind of Inverse Example for a Conjecture on Average Distance of Graphs

构造了一类图Gk,求出了它们的平均距离(?)(Gk),得到如下关系式(?)(Gk)>n/(δ+1)(n≥11),其中n=|V(Gk)|,δ是Gk的最小度.这个不等式指出文献[4]的猜想(?)(G)≤n/(δ+1)不成立.

In this paper the authors construct a kind of graph Gk,and prove that their distance (?)(Gk) satisfy:(?)(Gk)>n/(δ+ 1) (n≥11), this inequality directly disproves Shi Ronghua Conjecture[4].