Abstract
A t-spanner of a graph G=(V,E), is a sub-graph S G=(V,E′) , such that E′⊆E and for every edge {u,v}∈E, there is a path from u to v in S G of length at most t. A minimum-edge t-spanner of a graph G, S G′ , is the t-spanner of G with the fewest edges. For general graphs and for t=2, the problem of determining for a given integer s, whether |E(S G′)|⩽s is NP-Complete (Peleg and Schaffer, J. Graph Theory 13(1) (1989) 99–116). Peleg and Ullman (SIAM J. Comput. 18(4) (1989) 740–747), give a method for constructing a 3-spanner of the n-vertex Hypercube with fewer than 7n edges. In this paper we give an improved construction giving a 3-spanner of the n-vertex Hypercube with fewer than 4n edges and we present a lower bound of 3n/2− o(1) on the size of the optimal Hypercube 3-spanner.
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.
