Edge-disjoint spanning trees in the line graph of hypercubes

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(...