Title :
On the feasible tree-diameter sets of graphs
Author :
Shimizu, Toshihiko ; Shibata, Yukio
fDate :
8/1/1985 12:00:00 AM
Abstract :
A proof is given for the conjecture on feasible tree-diameter sets of graphs given by Harary et al. [2]. Some additional properties on feasible tree-diameter sets are studied.
Keywords :
Trees; Band pass filters; Chebyshev approximation; Computer science; Delay; Digital filters; Graph theory; Minimax techniques; Speech processing; Terminology; Tree graphs;
Journal_Title :
Circuits and Systems, IEEE Transactions on
DOI :
10.1109/TCS.1985.1085785
