On vertex-pancyclicity and edge-pancyclicity of the WK-Recursive network

  • Fang J
  • Huang C
  • 2

    Readers

    Mendeley users who have this article in their library.
  • 3

    Citations

    Citations of this article.

Abstract

In this paper, we study the pancyclic properties of the WK-Recursive networks. We show that a WK-Recursive network with amplitude W and level L is vertex-pancyclic for W ≥ 6. That is, each vertex on them resides in cycles of all lengths ranging from 3 to N, where N is the size of the interconnection network. On the other hand, we also investigate the m-edge-pancyclicity of the WK-Recursive network. We show that the WK-Recursive network is strictly 3 × 2L-1-edge-pancyclic for W ≥ 7 and L ≥ 1. That is, each edge on them resides in cycles of all lengths ranging from 3 × 2L-1to N; and the value 3 × 2L-1reaches the lower bound of the problem. © 2014 Elsevier Inc. All rights reserved.

Author-supplied keywords

  • Edge pancyclicity
  • Interconnection networks
  • Recursive networks
  • Vertex pancyclicity

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • Jywe Fei Fang

  • Chien Hung Huang

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free