共查询到20条相似文献,搜索用时 31 毫秒
1.
2.
3.
4.
5.
6.
7.
8.
9.
《Journal of Computer and System Sciences》2016,82(5):793-801
10.
11.
12.
13.
14.
15.
16.
17.
18.
Let be a connected graph on n vertices. The proximity of G is the minimum average distance from a vertex of G to all others. The eccentricity of a vertex v in G is the largest distance from v to another vertex, and the average eccentricity of the graph G is . Recently, it was conjectured by Aouchiche and Hansen (2011) [3] that for any connected graph G on vertices, , with equality if and only if . In this paper, we show that this conjecture is true. 相似文献
19.