Volume 14 Number 1 (Jan. 2019)
Home > Archive > 2019 > Volume 14 Number 1 (Jan. 2019) >
JCP 2019 Vol.14(1): 44-51 ISSN: 1796-203X
doi: 10.17706/jcp.14.1.44-51

The R-Hyper-Panconnectedness of Faulty Crossed Cubes

Hon-Chan Chen
Department of Information Management, National Chin-Yi University of Technology, Taiping, Taichung City 411, Taiwan.
Abstract—Among the many kinds of network topologies, the crossed cube is one of the most popular. It is a variant of the hypercube with some attracting properties. A network topology is usually represented by a graph, where vertices and edges of the graph represent the nodes and communication links of the network. In this paper, we investigate the r-hyper-panconnectedness of faulty crossed cubes. A graph G is said to be r-hyper-panconnected if for any two distinct vertices x and y of G, it contains a Hamiltonian path P starting from x such that d_P (x,y)=m for any integer m satisfying r≤m≤|V(G)|-1, in which d_P (x,y) denotes the distance between x and y in P. Let 〖CQ〗_n be an n-dimensional crossed cube. We demonstrate that for any one faulty vertex w of 〖CQ〗_n and for any two distinct vertices x and y of 〖CQ〗_n-{w}, n≥5, there exists a Hamiltonian path P of 〖CQ〗_n-{w} starting from x such that d_P (x,y)=m for any integer m satisfying 2n≤m≤2^n-2. That is, the crossed cube of one vertex fault is 2n-hyper-panconnected.

Index Terms—Crossed cube, hamiltonian path, path embedding, panconnectedness.

[PDF]

Cite: Hon-Chan Chen, "The R-Hyper-Panconnectedness of Faulty Crossed Cubes," Journal of Computers vol. 14, no. 1, pp. 44-51, 2019.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Monthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat, CNKI,etc
E-mail: jcp@iap.org
  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Jul 19, 2019 News!

    Vol 14, No 7 has been published with online version   [Click]

  • Jun 21, 2019 News!

    Vol 14, No 6 has been published with online version   [Click]

  • Apr 28, 2019 News!

    Vol 14, No 5 has been published with online version 7 papers are published in this issue after peer review   [Click]

  • Mar 20, 2019 News!

    Vol 14, No 3 has been published with online version   [Click]

  • Read more>>