Abstract
Farber et al. (1985) proved that any pair of edge-disjoint spanning trees in a graph can be obtained from any other by a sequence of single-edge exchanges in a way that preserves, at each step, the property of being edge-disjoint spanning trees. In this paper, we consider a generalization of this problem concerning pairs of edge-disjoint minimum-weight connected spanning k-edge subgraphs in a weighted graph. It is shown that any pair of edge-disjoint minimum-weight connected spanning k-edge subgraphs of a weighted graph can be obtained from any other by a sequence of single-edge exchanges in a way that preserves, at each step, the property of being edge-disjoint minimum-weight connected spanning k-edge subgraphs. As an application, we give a two-dimensional interpolating theorem for some graphical invariants.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
