The arrangement graph A nYk is not only a generalization of star graph (n À k 1), but also more¯exible. In this investigation, we elucidate the problem of embedding of multiple spanning trees in an arrangement graph with the objective of congestion-free. This result is to report how to exploit 2n À k edge disjoint spanning trees in an arrangement graph, where each congestion-free spanning tree's height is 2k À 1. Our scheme is based on a subgraphpartitioning scheme. First, we construct 2n À k base spanning trees in every A nÀk2Y2 . Then, we recursively construct 2n À k spanning trees from every A nÀk2Y2 up to A nYk by a bottom-up approach. This is a near-optimal result since all of possible edges in the base subarrangement A nÀk2Y2 are fully utilized. Ó
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.