Abstract
The aim of this paper is to prove that certain trees are spanning trees of the hypercube Q n . We introduce a new family of graphs which span hypercubes and we characterize the double starlike trees with maximum degree up to six that span a hypercube. We conclude by some open problems about spanning graphs and partitioning the hypercube into vertex-disjoint cycles of even lengths.
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.