Title :
On upper bounds in tree-diameter sets of graphs
Author :
Shibata, Yukio ; Fukue, Susumu
Author_Institution :
Dept. of Comput. Sci., Gunma Univ., Japan
fDate :
6/1/1989 12:00:00 AM
Abstract :
An upper bound in tree-diameter sets of connected graphs is given. Let S {a1, a2, . . ., an} be the tree-diameter set of a connected graph G in increasing order. It is proved that ai+1 ⩽a1+(1/2)a1 1⩽i⩽n-1
Keywords :
graph theory; trees (mathematics); connected graphs; tree-diameter sets; upper bounds; Circuits and systems; Digital filters; Error correction; Gradient methods; Information analysis; Iterative methods; Multidimensional signal processing; Optimization methods; Speech processing; Tree graphs;
Journal_Title :
Circuits and Systems, IEEE Transactions on
