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

Authors:
Jywe-Fei Fang;Yuh-Rau Wang;Hui-Ling Huang
Affiliations:
Department of Digital Content and Technology, National Taichung University, Taichung 403, Taiwan, ROC;Department of Computer Science and Information Engineering, St. John's University, Taipei 251, Taiwan, ROC;Department of Information Management, Southern Taiwan University of Technology, Tainan 710, Taiwan, ROC
Venue:
Information Sciences: an International Journal
Year:
2007

Citing 17
Cited 8

A recursively scalable network VLSI implementation

Future Generation Computer Systems
An optimized broadcasting technique for WK-Recursive topologies

Future Generation Computer Systems - Improving perfomance in multiprocessors and networks
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Edge-pancyclic block-intersection graphs

Discrete Mathematics - Special volume: Designs and Graphs
Fault-tolerant resource placement in balanced hypercubes

Information Sciences: an International Journal
Resource Placement in Torus-Based Networks

IEEE Transactions on Computers
Pancyclicity of recursive circulant graphs

Information Processing Letters
Efficient Resource Placement in Hypercubes Using Multiple-Adjacency Codes

IEEE Transactions on Computers
Embedding Graphs onto the Supercube

IEEE Transactions on Computers
Uniform Approach for Solving some Classical Problems on a Linear Array

IEEE Transactions on Parallel and Distributed Systems
On Balancing Sorting on a Linear Array

IEEE Transactions on Parallel and Distributed Systems
Hamiltonian properties on the class of hypercube-like networks

Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Hyper hamiltonian laceability on edge fault star graph

Information Sciences: an International Journal
Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs

Networks
Task assignment in heterogeneous computing systems

Journal of Parallel and Distributed Computing
On embedding cycles into faulty twisted cubes

Information Sciences: an International Journal
Complete path embeddings in crossed cubes

Information Sciences: an International Journal

The bipancycle-connectivity of the hypercube

Information Sciences: an International Journal
Strongly Hamiltonian laceability of the even k-ary n-cube

Computers and Electrical Engineering
Evaluating the energy consumption and the silicon area of on-chip interconnect architectures

Journal of Systems Architecture: the EUROMICRO Journal
The panconnectivity and the pancycle-connectivity of the generalized base-b hypercube

The Journal of Supercomputing
The recursive network-based routing algorithm

SEPADS'10 Proceedings of the 9th WSEAS international conference on Software engineering, parallel and distributed systems
Pancyclicity of OTIS (swapped) networks based on properties of the factor graph

Information Processing Letters
Geodesic pancyclicity and balanced pancyclicity of the generalized base-b hypercube

Discrete Applied Mathematics
Geodesic pancyclicity of twisted cubes

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

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 (5x2^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 5x2^L^-^1-2 to N, where N is the size of the interconnection network; and the value 5x2^L^-^1-2 reaches the lower bound of the problem.