Abstract
Abstract The minimum stretch spanning tree problem for a graph G is to find a spanning tree T of G such that the maximum distance in T between two adjacent vertices of G is minimized, where the minimum value is called the tree-stretchof G. There has been extensive study on the algorithmic aspects, such as the NP-hardness and fixed-parameter solvability. We are concerned in this paper with the computation of exact tree-stretch for given graph families. We relate an optimization approach of computing lower and upper bounds. This approach is applied to several typical graph families, such as the hypercubes Qn, the graph products Km × Kn, Pm × Kn, Cm × Cn, Pm × Cn, Pm × Pn, and Km × Cn.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.