Abstract
ABSTRACTTwisted hypercubes are generalizations of the Boolean hypercube, obtained by iteratively connecting two instances of a graph by a uniformly random perfect matching. Dudek et al. showed that when the two instances are independent, these graphs have optimal diameter. We study twisted hypercubes in the setting where the instances can have general dependence, and also in the particular case where they are identical. We show that the resultant graph shares properties with random regular graphs, including small diameter, large vertex expansion, a semicircle law for its eigenvalues and no non‐trivial automorphisms. However, in contrast to random regular graphs, twisted hypercubes allow for short routing schemes.
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.
