Article ID Journal Published Year Pages File Type
395247 Information Sciences 2007 9 Pages PDF
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.

Related Topics
Physical Sciences and Engineering Computer Science Artificial Intelligence
Authors
, , ,