DocumentCode
1191483
Title
On the diameters of spanning trees
Author
Sankaran, V. ; Krishnamoorthy, V.
Volume
32
Issue
10
fYear
1985
fDate
10/1/1985 12:00:00 AM
Firstpage
1060
Lastpage
1062
Abstract
The tree-diameter set of a connected graph 
is the set of all diameters of the spanning trees of , written in the increasing order. A relation between the consecutive elements of this set is obtained and it is shown to be the best possible. A sufficient condition for a set to be a feasible tree-diameter set is given and this solves a conjecture by Harary et al. on feasible tree-diameter sets.
is the set of all diameters of the spanning trees of , written in the increasing order. A relation between the consecutive elements of this set is obtained and it is shown to be the best possible. A sufficient condition for a set to be a feasible tree-diameter set is given and this solves a conjecture by Harary et al. on feasible tree-diameter sets.Keywords
Trees; Analytical models; Circuit analysis computing; Circuits and systems; Equations; Interpolation; Logic design; Mathematics; Sufficient conditions; Tree graphs;
fLanguage
English
Journal_Title
Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0098-4094
Type
jour
DOI
10.1109/TCS.1985.1085608
Filename
1085608
Link To Document