DocumentCode
1189318
Title
Interpolation theorem for diameters of spanning trees
Author
Harary, Frank ; Mokken, Robert J. ; Plantholt, Michael J.
Volume
30
Issue
7
fYear
1983
fDate
7/1/1983 12:00:00 AM
Firstpage
429
Lastpage
432
Abstract
We give an algorithmic approach for transforming any spanning tree of a 2-connected graph into any other spanning tree of the graph. At each step of the transformation we obtain a spanning tree whose diameter differs from that of the previous tree by at most one. Thus if a 2-connected graph 
has 
as the minimum and 
as the maximum diameter of a spanning tree, then for any integer 
between and , graph has a spanning tree of diameter .
has as the minimum and as the maximum diameter of a spanning tree, then for any integer between and , graph has a spanning tree of diameter .Keywords
Graph theory and combinatorics; Trees; Circuits and systems; Electrical engineering; Helium; Interpolation; Statistics; Terminology; Tree graphs;
fLanguage
English
Journal_Title
Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0098-4094
Type
jour
DOI
10.1109/TCS.1983.1085385
Filename
1085385
Link To Document