There is a well-known conjecture on independent spanning trees (ISTs) on graphs: For any n-connected graph G with n≥1, there are n ISTs rooted at an arbitrary node on G. It still remains open for n≥5. We propose an integrated algorithm to construct n ISTs rooted at any node similar to 0 or 10n-1 on n-dimensional HCH cube for n≥1 and give the simulations of ISTs on several special BC networks, such as HCH cubes, crossed cubes, Möbius cubes, twisted cubes, etc.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.