[PDF] Top 20 Fault-Tolerant Hamiltonian Connectivity and Fault-Tolerant Hamiltonicity of the Fully Connected Cubic Networks
Has 10000 "Fault-Tolerant Hamiltonian Connectivity and Fault-Tolerant Hamiltonicity of the Fully Connected Cubic Networks" found on our website. Below are the top 20 most common "Fault-Tolerant Hamiltonian Connectivity and Fault-Tolerant Hamiltonicity of the Fully Connected Cubic Networks".
Fault-Tolerant Hamiltonian Connectivity and Fault-Tolerant Hamiltonicity of the Fully Connected Cubic Networks
... on the fully connected cubic networks have been published for the past several years due to its favorite ...consider the fault-tol- erant hamiltonian ... See full document
8
Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
... neither hamiltonian nor hamil- tonian ...is hamiltonian but not hamiltonian connected if n > 1; F P Q 1,0 is hamiltonian connected but not ...2 and H F K(FP Q 0,k ) = 3k − ... See full document
12
Fault-tolerant hamiltonicity of twisted cubes
... 2001 The twisted cube TQ n , is derived by changing some connection of hyper- cube Q n according to specific ...properties of this variation cube are ...edge and/or node faults. Let F be a ... See full document
14
On some super fault-tolerant Hamiltonian graphs
... optimal fault-tolerant Hamiltonian if H f ðGÞ ¼ dðGÞ ...crossed-cubes, and M€ o obius cubes are proved to be optimal fault-tolerant Hamiltonian ...families of ... See full document
13
A recursively construction scheme for super fault-tolerant hamiltonian graphs
... Department of Computer and Information Engineering, Ta Hwa Institute of Technology, Hsinchu 300, Taiwan, ROC c Department of Computer and Information Science, National Chiao Tung ... See full document
17
Fault-tolerant hamiltonian connectivity of the WK-recursive networks
... on the WK-recursive network has been published during the past several years due to its favorite ...consider the fault-tolerant hamiltonian connectivity of ... See full document
10
Construction for fault-tolerant Hamiltonian and Hamiltonian-connected graphs
... The Hamiltonian property is one of major requirements in designing the topology of ...networks. Fault tolerance is also required for distributed ...introduce the ... See full document
10
Fault-tolerant hamiltonian connectedness of cycle composition networks
... Department of Computer Science, National Chiao Tung University, Hsinchu 30050, Taiwan, ROC b Department of Computer Science and Information Engineering, Providence University, Taichung 43301, Taiwan, ... See full document
12
Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs
... Keywords: Hamiltonian cycle; Hamiltonian connected; (n, k)- star graph ...INTRODUCTION The architecture of an interconnection network is usually represented by a ...designing the ... See full document
13
CONSTRUCTION SCHEMES OF THE OPTIMAL FAULT-TOLERANT NETWORKS FOR RINGS AND LINEAR ARRAYS 朱孝深、洪春男
... List of Figures ix Chapter 1 Introduction and definitions 1 Chapter 2 Construction for fault-tolerant Hamiltonian and Hamiltonian-connected graphs 4 ...2.1 ... See full document
2
Fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs
... view of A n;2 and then present some of its special ...consists of nðn 1Þ vertices and nðn 1Þðn 2Þ ...string and, clearly, connects to 2ðn 2Þ neighbors, where half ... See full document
15
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
... adopting the conditional fault model and assuming that there were two or more non-faulty edges incident to each node, we showed that an n-dimensional pancake graph contains a fault-free ... See full document
11
Fault-tolerant Hamiltonian laceability of bipartite hypercube-like networks
... -The fault tolerance for Hamiltonian properties of n-dimensional bipartite hypercube-like graphs X n are ...explored. The main result of this paper is that X n – F is ... See full document
5
Fault-tolerant hamiltonian laceability of hypercubes
... 2 and F is a subset of edges with |F | n − ...a hamiltonian path in Q n − F between any two vertices of different partite ...path of length 2 n − 2 between any two vertices of ... See full document
6
Construction schemes for fault-tolerant Hamiltonian graphs
... Institute of Information Science, Academia Sinica, Taipei, Taiwan 115, Republic of China In this paper, we present three construction schemes for fault-tolerant Hamiltonian ...on ... See full document
13
Conditional fault hamiltonian connectivity of the complete graph
... Conditional fault hamiltonian connectivity of the complete graph Tung-Yang Ho a ,∗ , Yuan-Kang Shih b , Jimmy ...Department of Information Management, Ta Hwa Institute of ... See full document
4
A fault-tolerant architecture for ATM networks
... Abstract The asynchronous transfer mode (ATM) is the transfer mode recommended for the broad integrated service digital network (B-ISDN) by ...self-routing fault-tolerant switching ... See full document
9
Fault tolerant crossconnect and wavelength routing in all-optical networks
... In our restoration mechanism, the controller in node X configures the optical switch C to reroute the failed lightpath to the spare optical switchkhannel S and keep[r] ... See full document
5
A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance
... faults and link (edge) faults may happen when a network is used, and it is meaningful to consider networks (graphs) with faulty processors and/or ...k-regular Hamiltonian and ... See full document
10
Fault-tolerant and progressive transmission of images
... way, the information contained in the image is par- titioned into several parts and the most significant part is transmitted first while the least significant part is transmit- ted ...If ... See full document
6
相關主題