摘要
图的平均距离在网络的性能分析中很重要,是度量整个互联网络通信效率的重要参数。本文对图的平均距离的延伸进行了系统的归纳和总结,并证明了如果图G是最小度为d的n阶无向图,则μd+n1+2。
Mean distance in graphs was very important in analysing function of network. It serves as a measure of efficiency of a heavily used network. The extend of mean distance in graphs was systematically summarized and proved that in a graph of order is minimum degree, the mean distance must satisfy μ≤n/d＋1＋2.
出处
《内蒙古农业大学学报（自然科学版）》
CAS
2006年第3期118-120,共3页
Journal of Inner Mongolia Agricultural University(Natural Science Edition)
关键词
图的平均距离
最小度
阶
距离
直径
网络
路
Mean distance
minimum degree
order
distance
diameter
network
path
