Volume I: Parallel architectures on PARLE: Parallel Architectures and Languages Europe
The Twisted N-Cube with Application to Multiprocessing
IEEE Transactions on Computers
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
On the generalized twisted cube
Information Processing Letters
On ring embedding in hypercubes with faulty nodes and links
Information Processing Letters
Fault-Free Hamiltonian Cycles in Faulty Arrangement Graphs
IEEE Transactions on Parallel and Distributed Systems
Recursive circulants and their embeddings among hypercubes
Theoretical Computer Science
Longest Fault-Free Paths in Star Graphs with Edge Faults
IEEE Transactions on Computers
Fault-tolerant Hamiltonicity of twisted cubes
Journal of Parallel and Distributed Computing
The Crossed Cube Architecture for Parallel Computation
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
The Mcube: a symmetrical cube based network with twisted links
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Fault-tolerant cycle embedding in the hypercube
Parallel Computing
Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs
IEEE Transactions on Computers
Linear array and ring embeddings in conditional faulty hypercubes
Theoretical Computer Science
Hamiltonian properties on the class of hypercube-like networks
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Longest paths and cycles in faulty star graphs
Journal of Parallel and Distributed Computing
Graph Theory With Applications
Graph Theory With Applications
Fault-hamiltonicity of product graph of path and cycle
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Many-to-Many disjoint path covers in a graph with faulty elements
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Many-to-Many Disjoint Path Covers in Hypercube-Like Interconnection Networks with Faulty Elements
IEEE Transactions on Parallel and Distributed Systems
Minimum neighborhood in a generalized cube
Information Processing Letters
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Theoretical Computer Science
Panconnectivity and edge-pancyclicity of faulty recursive circulant G(2m,4)
Theoretical Computer Science
Network load-aware content distribution in overlay networks
Computer Communications
Optimal node-selection algorithm for parallel download in overlay content-distribution networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Conditional matching preclusion for hypercube-like interconnection networks
Theoretical Computer Science
Fault-Tolerant Hamiltonicity of Augmented Cubes under the Conditional Fault Model
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Minimum neighborhood in a generalized cube
Information Processing Letters
Conditional edge-fault Hamiltonicity of augmented cubes
Information Sciences: an International Journal
Hamiltonicity of matching composition networks with conditional edge faults
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Embedding meshes into locally twisted cubes
Information Sciences: an International Journal
Pancyclicity of Restricted Hypercube-Like Networks under the Conditional Fault Model
SIAM Journal on Discrete Mathematics
Hamiltonian properties of twisted hypercube-like networks with more faulty elements
Theoretical Computer Science
Embedding meshes into twisted-cubes
Information Sciences: an International Journal
Disjoint path covers in recursive circulants G(2m,4) with faulty elements
Theoretical Computer Science
Wirelength of 1-fault hamiltonian graphs into wheels and fans
Information Processing Letters
Theoretical Computer Science
Fault diagnosis for hypercube-like networks
AICT'11 Proceedings of the 2nd international conference on Applied informatics and computing theory
Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Embedding starlike trees into hypercube-like interconnection networks
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
An algorithm to construct independent spanning trees on parity cubes
Theoretical Computer Science
Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
Theoretical Computer Science
Strong matching preclusion under the conditional fault model
Discrete Applied Mathematics
Parallel construction of independent spanning trees and an application in diagnosis on Möbius cubes
The Journal of Supercomputing
| Hi-index | 0.01 |
We call a graph G to be f-fault hamiltonian (resp. f-fault hamiltonian-connected) if there exists a hamiltonian cycle (resp. if each pair of vertices are joined by a hamiltonian path) in G\F for any set F of faultry elements with |F| 驴 f.In this paper, we deal with the graph G驴 and G驴 with n vertices each by n pairwise nonadjacent edges joining vertices in G驴 and vertices in G驴.Provided each G_i is f-fault hamiltonian-connected and f + 1-fault hamiltonian, 0 驴 i 驴 3, we show that G驴 驴 G驴.Many interconnection networks such as hypercube-like interconnection networks can be represented in the form of G驴 驴 驴 connecting two lower dimensional networks G驴 and G驴.Applying our main results to a subclass of hypercube-like interconnection networks, called restricted HL-graphs, which include twisted cubes, crossed cubes, multiply twisted cubes, Möbius cubes, Mcubes, and generalized twisted cubes, we show that every restricted HL-graph of degree m(驴 3) is m - 3-fault hamiltonian-connected and m - 2-fault hamiltonian.