Congestion-free embedding of 2 (n-k) spanning trees in an arrangement graph

Embedding k(n - k) edge-disjoint spanning trees in arrangement graphs

Journal of Parallel and Distributed Computing

Constructing edge-disjoint spanning trees in locally twisted cubes

Theoretical Computer Science

Generalized sequence-based and reverse sequence-based models for broadcasting hot videos

IEEE Transactions on Multimedia

Reliable application layer multicast over combined wired and wireless networks

IEEE Transactions on Multimedia

Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes

Information Processing Letters

Constructing edge-disjoint spanning trees in twisted cubes

Information Sciences: an International Journal

Broadcasting secure messages via optimal independent spanning trees in folded hypercubes

Discrete Applied Mathematics

Fault diagnosability of arrangement graphs

Information Sciences: an International Journal