Constructing Independent Spanning Trees on Transposition Networks
In interconnection networks, data distribution and fault tolerance are crucial services. This study proposes an effective algorithm for improving connections between networks. Transposition networks are a type of Cayley graphs and have been widely used in current networks. Whenever any connection no...
Main Authors: | Chien-Fu Lin, Jie-Fu Huang, Sun-Yuan Hsieh |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2020-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/9160957/ |
Similar Items
-
Top-Down Construction of Independent Spanning Trees in Alternating Group Networks
by: Jie-Fu Huang, et al.
Published: (2020-01-01) -
Constructing Independent Spanning Trees on Pancake Networks
by: Dun-Wei Cheng, et al.
Published: (2020-01-01) -
Constructing Independent Spanning Trees on Generalized Recursive Circulant Graphs
by: Dun-Wei Cheng, et al.
Published: (2021-01-01) -
The Construction of Multiple Independent Spanning Trees on Burnt Pancake Networks
by: Yi-Cheng Yang, et al.
Published: (2021-01-01) -
Completely Independent Spanning Trees in k-Th Power of Graphs
by: Hong Xia
Published: (2018-08-01)