| 1 |
| Authors | F. Harary, R.J. Mokken, M.J. Plantholt | | Title | Interpolation theorem for diameters of spanning trees |
| Journal | IEEE transactions on circuits and systems |
| Volume | 30 |
| Year | 1983 |
| Issue | 7 |
| Pages | 429-432 |
| ISSN | 00984094 |
| Faculty | Faculty of Social and Behavioural Sciences |
| 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 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. |
| Document type | Article |
| Document finder | 
|
Use this url to link to this page: http://dare.uva.nl/en/record/360613
Contact us about this recordNotify a colleague
Add to bookbag
|
