Abstract
In the past few years, edge-disjoint spanning trees (EDSTs) have attracted extensive attention due to their applications in reliable communication, fault-tolerant broadcasting, secure message distribution, etc. As one architecture of many interconnection networks, hypercubes (denoted as Qn ) play an important role in parallel computing systems, as well as their line graphs (denoted as L(Qn )), but few results of EDSTs in L(Qn ) are reported. In this paper, we establish the relation between EDSTs in Qn and EDSTs in L(Qn ), then we propose an algorithm to obtain the EDSTs in L(Qn ) and present the corresponding simulation experiment to verify its validity.