## Abstract

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 graph <formula><tex>$K_n$</tex></formula> (denoted <formula><tex>$L(K_n)$</tex></formula>, for <formula><tex>$n\geq4$</tex></formula>), and present an algorithm to construct the optimal (i.e. maximal) number of CISTs in <formula><tex>$L(K_n)$</tex></formula>. The <formula><tex>$L(K_n)$</tex></formula> 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.

Original language | English |
---|---|

Journal | IEEE Transactions on Computers |

DOIs | |

State | Accepted/In press - 2021 |

## Keywords

- Bipartite graph
- Color
- Computer science
- Data centers
- Data models
- Ink
- Terminology