Hits:

Indexed by:期刊论文

Date of Publication:2011-06-01

Journal:INFORMATION SCIENCES

Included Journals:Scopus、SCIE、EI

Volume:181

Issue:11

Page Number:2268-2277

ISSN No.:0020-0255

Key Words:Combinatorics; Locally twisted cubes; Edge-pancyclic; Fault-tolerant

Abstract:The n-dimensional locally twisted cube LTQ(n) is a new variant of the hypercube, which possesses some properties superior to the hypercube. This paper investigates the fault-tolerant edge-pancyclicity of LTQ(n), and shows that if LTQ(n) (n >= 3) contains at most n - 3 faulty vertices and/or edges then, for any fault-free edge e and any integer l with 6 <= l <= 2(n) - f(v), there is a fault-free cycle of length l containing the edge e, where f(v) is the number of faulty vertices. The result is optimal in some senses. The proof is based on the recursive structure of LTQ(n). (C) 2011 Elsevier Inc. All rights reserved.