ON GENERALIZED WIDE DIAMETER OF GRAPHS
Xinmin Hou, Tianming Wang · 2003
Abstract. The wide diameter of a graph is a natural generalization of diameter in a graph when we take account of the connectivity of the graph. In this paper, we define the generalized wide diameter of a graph and show that every kregular k-connected graph on n vertices has generalized k-diameter at most n=2 and this upper bound cannot be improved when n = 4k ¡ 6+ i(2k ¡ 4). 1.