[PDF] Top 20 Mutually independent hamiltonian cycles for the pancake graphs and the star graphs
Has 10000 "Mutually independent hamiltonian cycles for the pancake graphs and the star graphs" found on our website. Below are the top 20 most common "Mutually independent hamiltonian cycles for the pancake graphs and the star graphs".
Mutually independent hamiltonian cycles for the pancake graphs and the star graphs
... ) mutually independent hamiltonian cycles of S n starting form the vertex ...discuss the mutually independent hamiltonian cycles for the ... See full document
10
Fault-free mutually independent Hamiltonian cycles of faulty star graphs
... that the maximum number of mutually independent Hamiltonian cycles rooted at any vertex can be constructed recursively in the star graph interconnection network ... See full document
18
The super connectivity of the pancake graphs and the super laceability of the star graphs
... -connected for any3 k (G). For this reason, a bipartite graph is k ∗ -laceable if there exists a k ∗ -container between any two vertices from different partite ...has the equal size of ...as ... See full document
15
The Hamiltonian properties for faulty pancake graphs 梁高源、洪春男
... On the mapping problem, IEEE ...On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network, Information Sciences 126, ...Hsieh and G. H. Chen, ... See full document
2
On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
... on the basis of inter- connection networks such as meshes, hypercubes, star graphs, bubble-sort networks, ...etc. For the sake of simplicity, the underlying topology of an ... See full document
17
A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
... on the basis of in- terconnection networks such as hypercubes, star graphs, meshes, bubble-sort net- works, ...etc. For the sake of simplicity, a network topology is usually represented ... See full document
11
The Study of Adjacent Vertices Fault Tolerance Hamiltonian Laceability of Star Graphs 歐宗翰、洪春男
... in star graphs with edge faults,” Applied Mathematics and Computation, 167, ...of the pancake graphs and the super laceability of the star ... See full document
2
The Study of Edge Fault-Tolerance for Hamiltonian Cycles and Hamiltonian Paths Passing through Prescribed Edges of Star 游宗育、洪春男
... Huang, and L. H. Hsu,``The super connectivity of the pancake graphs and the super laceability of the star graphs,'' Theoretical Computer Science, ... See full document
2
The construction of mutually independent Hamiltonian cycles in bubble-sort graphs
... in the publications on our ...agents, and our licensors make no representations or warranties whatsoever as to the accuracy, completeness, or suitability for any purpose of the ... See full document
16
Mutually independent hamiltonian cycles of binary wrapped butterfly graphs
... crucial for improving performance in multiprocessor/communication ...paper, the mutually independent hamiltonicity is addressed for its effective utilization of resources on the ... See full document
12
Mutually Independent Hamiltonian Connectivity of (n, k)-Star Graphs
... of mutually independent hamiltonian paths arises from the following ...v, and the data need to be processed at every node (and the process takes time), then we want ... See full document
26
The Mutually Independent Edge-Bipancyclic Property in Hypercube Graphs
... all the vertices of G. A graph G is hamiltonian connected if there exists a hamiltonian path between any two different vertices of ...is the union of two disjoint sets B and W such that ... See full document
5
Mutually independent Hamiltonian cycles in dual-cubes
... in mutually independent Hamiltonian ...vertices, and each vertex u can be distinctly labeled by an n-bit binary string, u = u n −1 u n −2 · · · u 1 u 0 ...if and only if their binary ... See full document
13
Hamiltonian-Laceability in Star Graphs with Conditional Edge Faults
... arrays and rings, which are two of the most fundamental networks for parallel and distributed computation, are suitable for designing simple algorithms with low communication ...arrays ... See full document
9
Fault hamiltonicity and fault hamiltonian connectivity of the arrangement graphs
... stronger and simpler statement. We prove that A n;k is ðkðn kÞ 2Þ-Hamiltonian and ðkðn kÞ 3Þ-Hamiltonian con- nected if n k 2, where the faults can be vertices and ... See full document
15
Construction for fault-tolerant Hamiltonian and Hamiltonian-connected graphs
... use graphs and networks interchangeably. The ring and linear array topologies have been used frequently due to their good properties such as simplicity, expandability and easiness of ... See full document
10
On mutually independent hamiltonian paths
... of hamiltonian connected ... and P 2 = u 1 , u 2 , u 3 , . . . , u n be any two hamiltonian paths of ...1 and P 2 are independent if u 1 = v 1 , u n = v n , and u i = v i ... See full document
6
Fault-free Hamiltonian cycles in alternating group graphs with conditional edge faults
... factor for the interconnection networks since it determines the performance of the ...in the literature for the purpose of connecting hundreds or thousands of processing ... See full document
10
The Mutually Independent Bipanconnected Property for Hypercube
... divide the hypercube Q n into two subcubes Q 0 n−1 and Q 1 n−1 such that u is a black vertex in Q 0 n−1 and v a white vertex in Q 1 n−1 ...1 mutually independent hamiltonian ... See full document
4
Edge-fault-tolerant Hamiltonicity of pancake graphs under the conditional fault model
... under the same fault model and assumption as ours, where n is the dimension of the mentioned ...network. The hypercube (star graph) with up to 2n − 5 ( 2n − 7 ) link faults ... See full document
11
相關主題