THE AVERAGE DISTANCE OF A CONNECTED GRAPH  

作　　者：施容华 

机构地区：[1]Department of Applied Mathematics, East China Institute of Technology,, Nanjing 210014, PRC

出　　处：《Chinese Science Bulletin》1991年第4期348-348,共1页

基　　金：Project supported by the National Natural Science Foundation of China.

摘　　要：The diameter D(G) and the average distance of a graph G are D(G)= {d_G(u, v)|u≠v, u, v∈V(G)} and which are interesting graph-theoretical invariants in their own right, and they play significant roles in analyzing communication networks.

关 键 词：INVARIANTS CONNECTED LETTER 二凡 召刀 

分 类 号：N[自然科学总论]