The Paper with the title ofConstructing Completely Independent Spanning Trees in a Family of Line-Graph-Based Data Center Networkswith 2017 Undergraduate Wang Yifeng fromSchool of Computer Science & Technologybeing the first author was accepted byIEEE Transactions on Computers, a top Journal in the field of computer architecture.

The abstract could be described briefly as follows. The past decade has seen growing importance being attached to the {\em Completely Independent Spanning Trees} (CISTs). The CISTs can facilitate many network functionalities, and the existence and construction schemes of CISTs in various networks can be an indicator of the network's robustness. In this paper, we establish the number of CISTs that can be constructed in the {\em line graph} of the complete graphKn(denotedL(Kn), forn≥4), and present an algorithm to construct the optimal (i.e. maximal) number of CISTs inL(Kn). TheL(Kn)is a special class of SWCube \cite{Li001}, an architectural model proposed for data center networks. Our construction algorithm is also implemented to verify its validity.