System design of the J-Machine
AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Graph Theory With Applications
Graph Theory With Applications
Optimal Path Embedding in Crossed Cubes
IEEE Transactions on Parallel and Distributed Systems
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Hamiltonian Path Embedding and Pancyclicity on the Möbius Cube with Faulty Nodes and Faulty Edges
IEEE Transactions on Computers
Optimal fault-tolerant embedding of paths in twisted cubes
Journal of Parallel and Distributed Computing
Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes
Journal of Parallel and Distributed Computing
The bipanconnectivity and m-panconnectivity of the folded hypercube
Theoretical Computer Science
Panconnectivity and edge-pancyclicity of 3-ary N-cubes
The Journal of Supercomputing
Embedding cycles and paths in a k-ary n-cube
ICPADS '07 Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01
Bipanconnectivity and Bipancyclicity in k-ary n-cubes
IEEE Transactions on Parallel and Distributed Systems
Conditional Edge-Fault Hamiltonicity of Matching Composition Networks
IEEE Transactions on Parallel and Distributed Systems
Strongly Hamiltonian laceability of the even k-ary n-cube
Computers and Electrical Engineering
Path embeddings in faulty 3-ary n-cubes
Information Sciences: an International Journal
Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links
Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes
Information Sciences: an International Journal
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
SIAM Journal on Discrete Mathematics
Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
Discrete Applied Mathematics
Complete path embeddings in crossed cubes
Information Sciences: an International Journal
Edge disjoint Hamiltonian cycles in k-ary n-cubes and hypercubes
IEEE Transactions on Computers
| Hi-index | 0.04 |
The torus network is one of the most popular interconnection topologies for massively parallel computing systems. In this paper, we mainly consider the p-panconnectivity of n-dimensional torus networks with faulty elements (vertices and/or edges). A graph G is said to be p-panconnected if for each pair of distinct vertices u,v@?V(G), there exists a (u,v)-path of each length ranging from p to |V(G)|-1. A graph G is m-fault p-panconnected if G-F is still p-panconnected for any F@?V(G)@?E(G) with |F|@?m. By using an introduction argument, we prove that the n-dimensional torus T"2"k"""1"+"1","2"k"""2"+"1","...","2"k"""n"+"1 is @?"i"="1^nk"i-panconnected and (2n-3)-fault [@?"i"="1^n(k"i+1)-1]-panconnected.