|
|||||
|
|
The m-pancycle-connectivity of a WK-Recursive network |
|
| Authors: | Jywe-Fei Fang Yuh-Rau Wang |
| Affiliation: | a Department of Digital Content and Technology, National Taichung University, Taichung 403, Taiwan, ROC b Department of Computer Science and Information Engineering, St. John’s University, Taipei 251, Taiwan, ROC c Department of Information Management, Southern Taiwan University of Technology, Tainan 710, Taiwan, ROC |
| Abstract: | In this paper, we study the m-pancycle-connectivity of a WK-Recursive network. We show that a WK-Recursive network with amplitude W and level L is strictly (5 × 2L−1 − 2)-pancycle-connected for W ? 3. That is, each pair of vertices in a WK-recursive network with amplitude greater than or equal to 3 resides in a common cycle of every length ranging from 5 × 2L−1 − 2 to N, where N is the size of the interconnection network; and the value 5 × 2L−1 − 2 reaches the lower bound of the problem. |
| Keywords: | Interconnection networks WK-recursive networks m-Pancycle-connectivity |
| 本文献已被 ScienceDirect 等数据库收录！ | |