Abstract
The arrangement graph A/sub n,k/ is a generalization of star graph (n-k=1) and more flexible than the star graph. In this paper we consider the embedding of multiple spanning trees in an arrangement graph with the objective of being congestion-free. This is first result to exploit multiple spanning trees in the arrangement graphs. We develop a congestion-free embedding of n-k spanning trees with height 2k-1 in an (n, k)-dimensional arrangement graph.
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.
