The restricted connectivity of locally twisted cubes

Jianxi Fan; Shukui Zhang; Xiaohua Jia; Guangquan Zhang

doi:10.1109/I-SPAN.2009.48

The restricted connectivity of locally twisted cubes

Jianxi Fan
, Shukui Zhang
, Xiaohua Jia
, Guangquan Zhang

Department of Computer Science

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

11 Citations (Scopus)

Abstract

In this paper, we study the restricted connectivity and restricted fault-diameters of locally twisted cubes under the condition that each node has at least one fault-free neighbor. First, we prove that under the condition that if each node of an n-dimensional locally twisted cube LTQ_n has at least one fault-free neighbor its restricted connectivity is 2n-2, the same as that of the n-dimensional hypercube. Then, we give an upper bound on the restricted fault-diameter of LTQ_n, that is, the restricted fault-diameter of LTQ_n is no more than the fault-diameter of LTQ _n plus 6. © 2009 IEEE.

Original language	English
Title of host publication	I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks
Pages	574-578
DOIs	https://doi.org/10.1109/I-SPAN.2009.48
Publication status	Published - 2009
Event	10th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2009 - Kaohsiung, Taiwan, China Duration: 14 Dec 2009 → 16 Dec 2009

Conference

Conference	10th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2009
Place	Taiwan, China
City	Kaohsiung
Period	14/12/09 → 16/12/09

Research Keywords

Connectivity
Fault-free path
Locally twisted cube
Set of restricted faulty nodes
Unicast

Access Output

10.1109/I-SPAN.2009.48

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@inproceedings{16a58de7b32d4cce86f38a6dff57d7f3,

title = "The restricted connectivity of locally twisted cubes",

abstract = "In this paper, we study the restricted connectivity and restricted fault-diameters of locally twisted cubes under the condition that each node has at least one fault-free neighbor. First, we prove that under the condition that if each node of an n-dimensional locally twisted cube LTQn has at least one fault-free neighbor its restricted connectivity is 2n-2, the same as that of the n-dimensional hypercube. Then, we give an upper bound on the restricted fault-diameter of LTQn, that is, the restricted fault-diameter of LTQn is no more than the fault-diameter of LTQ n plus 6. {\textcopyright} 2009 IEEE.",

keywords = "Connectivity, Fault-free path, Locally twisted cube, Set of restricted faulty nodes, Unicast",

author = "Jianxi Fan and Shukui Zhang and Xiaohua Jia and Guangquan Zhang",

year = "2009",

doi = "10.1109/I-SPAN.2009.48",

language = "English",

isbn = "9780769539089",

pages = "574--578",

booktitle = "I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks",

note = "10th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2009 ; Conference date: 14-12-2009 Through 16-12-2009",

}

Fan, J, Zhang, S, Jia, X & Zhang, G 2009, The restricted connectivity of locally twisted cubes. in I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks., 5381659, pp. 574-578, 10th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2009, Kaohsiung, Taiwan, China, 14/12/09. https://doi.org/10.1109/I-SPAN.2009.48

The restricted connectivity of locally twisted cubes. / Fan, Jianxi; Zhang, Shukui; Jia, Xiaohua et al.
I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks. 2009. p. 574-578 5381659.

Research output: Chapters, Conference Papers, Creative and Literary Works › RGC 32 - Refereed conference paper (with host publication) › peer-review

TY - GEN

T1 - The restricted connectivity of locally twisted cubes

AU - Fan, Jianxi

AU - Zhang, Shukui

AU - Jia, Xiaohua

AU - Zhang, Guangquan

PY - 2009

Y1 - 2009

N2 - In this paper, we study the restricted connectivity and restricted fault-diameters of locally twisted cubes under the condition that each node has at least one fault-free neighbor. First, we prove that under the condition that if each node of an n-dimensional locally twisted cube LTQn has at least one fault-free neighbor its restricted connectivity is 2n-2, the same as that of the n-dimensional hypercube. Then, we give an upper bound on the restricted fault-diameter of LTQn, that is, the restricted fault-diameter of LTQn is no more than the fault-diameter of LTQ n plus 6. © 2009 IEEE.

AB - In this paper, we study the restricted connectivity and restricted fault-diameters of locally twisted cubes under the condition that each node has at least one fault-free neighbor. First, we prove that under the condition that if each node of an n-dimensional locally twisted cube LTQn has at least one fault-free neighbor its restricted connectivity is 2n-2, the same as that of the n-dimensional hypercube. Then, we give an upper bound on the restricted fault-diameter of LTQn, that is, the restricted fault-diameter of LTQn is no more than the fault-diameter of LTQ n plus 6. © 2009 IEEE.

KW - Connectivity

KW - Fault-free path

KW - Locally twisted cube

KW - Set of restricted faulty nodes

KW - Unicast

UR - https://www.scopus.com/pages/publications/77949822667

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-77949822667&origin=recordpage

U2 - 10.1109/I-SPAN.2009.48

DO - 10.1109/I-SPAN.2009.48

M3 - RGC 32 - Refereed conference paper (with host publication)

SN - 9780769539089

SP - 574

EP - 578

BT - I-SPAN 2009 - The 10th International Symposium on Pervasive Systems, Algorithms, and Networks

T2 - 10th International Symposium on Pervasive Systems, Algorithms, and Networks, I-SPAN 2009

Y2 - 14 December 2009 through 16 December 2009

ER -

The restricted connectivity of locally twisted cubes

Abstract

Conference

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this