The m-pancycle-connectivity of a WK-Recursive network

被引：18

作者：

Fang, Jywe-Fei ^{[1
]}

Wang, Yuh-Rau

Huang, Hui-Ling

机构：

[1] Natl Taichung Univ, Dept Digital Content & Technol, Taichung 403, Taiwan

[2] St Johns Univ, Dept Comp Sci & Informat Engn, Taipei 251, Taiwan

[3] SO Taiwan Univ Technol, Dept Informat Management, Tainan 710, Taiwan

来源：

INFORMATION SCIENCES | 2007年 / 177卷 / 24期

关键词：

interconnection networks; WK-recursive networks; m-Pancycle-connectivity;

D O I：

10.1016/j.ins.2007.04.013

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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 x 2(L-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 x (2L-1) - 2 to N, where N is the size of the interconnection network; and the value 5 x 2 (L-1) - 2 reaches the lower bound of the problem. (C) 2007 Elsevier Inc. All rights reserved.

引用

页码：5611 / 5619

页数：9

共 25 条

[1] EDGE-PANCYCLIC BLOCK-INTERSECTION GRAPHS [J].

ALSPACH, B ;

HARE, D .

DISCRETE MATHEMATICS, 1991, 97 (1-3) :17-24

[2] Pancyclicity of recursive circulant graphs [J].

Araki, T ;

Shibata, Y .

INFORMATION PROCESSING LETTERS, 2002, 81 (04) :187-190

[3] EMBEDDING GRAPHS ONTO THE SUPERCUBE [J].

AULETTA, V ;

RESCIGNO, AA ;

SCARANO, V .

IEEE TRANSACTIONS ON COMPUTERS, 1995, 44 (04) :593-597

[4] Resource placement in torus-based networks [J].

Bae, MM ;

Bose, B .

IEEE TRANSACTIONS ON COMPUTERS, 1997, 46 (10) :1083-1092

[5] Embedding cycles in IEH graphs [J].

Chang, HY ;

Chen, RJ .

INFORMATION PROCESSING LETTERS, 1997, 64 (01) :23-27

[6] Panconnectivity, fault-tolerant Hamiltonicity and Hamiltonian-connectivity in alternating group graphs [J].

Chang, JM ;

Yang, JS .

NETWORKS, 2004, 44 (04) :302-310

[7]

Chartrand G., 1993, Applied and algorithmic graph theory

[8] EFFICIENT RESOURCE PLACEMENT IN HYPERCUBES USING MULTIPLE-ADJACENCY CODES [J].

CHEN, HL ;

TZENG, NF .

IEEE TRANSACTIONS ON COMPUTERS, 1994, 43 (01) :23-33

[9] Complete path embeddings in crossed cubes [J].

Fan, Jianxi ;

Jia, Xiaohua ;

Lin, Xiaola .

INFORMATION SCIENCES, 2006, 176 (22) :3332-3346

[10]

FANG JF, 2003, COMPUTERS SIGNAL PRO, V2, P1028

← 1 2 3 →