- Interpolation theorem for diameters of spanning trees
- IEEE transactions on circuits and systems
- Volume | Issue number
- 30 | 7
- Pages (from-to)
- Document type
- Faculty of Social and Behavioural Sciences (FMG)
- 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 G has a as the minimum and b as the maximum diameter of a spanning tree, then
for any integer c between a and b, graph G has a spanning tree of diameter c.
- go to publisher's site
If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library, or send a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible.