Paths and cycles identifying vertices in twisted cubes

被引：3
作者：
Lai, Pao-Lien [1 ]
机构：
[1] Natl Dong Hwa Univ, Dept Comp Sci & Informat Engn, Shoufeng 97401, Hualien, Taiwan
来源：
APPLIED MATHEMATICS AND COMPUTATION | 2015年 / 259卷
关键词：
Identify; Fault diagnosis; Gray code; Twisted cubes; Path; Cycle; GENERALIZED GRAY CODES; HAMILTONIAN CYCLES; CROSSED CUBE; EDGE; MULTIPROCESSORS; IDENTIFICATION; SIMULATION; FAMILIES; LATTICE; GRAPHS;
D O I：
10.1016/j.amc.2015.02.090
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The hypercube is one of the most popular interconnection networks since it has simple structure and is easy to implement. The twisted cube is an important variation of the hypercube and preserves many of its desirable properties. Karpovsky et al. introduced the concept of identifying codes to model fault-detection in multiprocessor systems and Honkala et al. developed an identifying code by using cycles to identify the faulty processors in the hypercube. In this paper, we study the vertex identification problem on the twisted cube. We first propose an interesting construction scheme to build paths and cycles, and furthermore apply a minimum number of paths and cycles to identify the faulty processors of the twisted cube. (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码：620 / 627
页数：8
相关论文
共 39 条
  • [1] THE TWISTED CUBE TOPOLOGY FOR MULTIPROCESSORS - A STUDY IN NETWORK ASYMMETRY
    ABRAHAM, S
    PADMANABHAN, K
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 13 (01) : 104 - 110
  • [2] Blass U, 2000, J COMB DES, V8, P151, DOI 10.1002/(SICI)1520-6610(2000)8:2<151::AID-JCD8>3.0.CO
  • [3] 2-S
  • [4] Bounds on identifying codes
    Blass, U
    Honkala, I
    Litsyn, S
    [J]. DISCRETE MATHEMATICS, 2001, 241 (1-3) : 119 - 128
  • [5] Bondy J.A., 1980, Graph Theory with Applications
  • [6] Topological properties of twisted cube
    Chang, CP
    Wang, JN
    Hsu, LH
    [J]. INFORMATION SCIENCES, 1999, 113 (1-2) : 147 - 167
  • [7] The minimum density of an identifying code in the king lattice
    Charon, I
    Honkala, I
    Hudry, O
    Lobstein, A
    [J]. DISCRETE MATHEMATICS, 2004, 276 (1-3) : 95 - 109
  • [8] Charon I., 2001, ELECTRON J COMB, V8, pR39
  • [9] Charon I, 2002, ELECTRON J COMB, V9
  • [10] Chen J. C., 2014, 31 WORKSH COMB MATH, P37
1234