[PDF] Top 20 The Study for Adjacent Vertices Fault-Tolerance Bifanability of Hypercube

... Terms—hypercube, vertices fault-tolerance, fan- ability, bifanability, Hamiltonian-laceable ...NTRODUCTION The hypercube network is one of the most popular ... See full document

... investigate adjacent vertices fault-tolerance bifanability of hypercube with the same color ...be the n-dimensional hypercube. Let F_a be the ... See full document

... discussion of nature about study of vertex fault-tolerance for multiple spanning paths in n-dimensional ...vertex fault-tolerant Hamiltonian properties of more ... See full document

... discussion of nature about study of vertex fault-tolerance for multiple spanning paths in n-dimensional ...family of G = (Vb∪Vw, E) where Kb (?} Vb) ∪ Kw (?} Vw) = {si, ... See full document

... investigate the adjacent vertex fault-tolerance for two spanning disjoint path of hypercube in this ...be the set of｜Fa︱pairs of adjacently faulty ... See full document

... ABSTRACT In this thesis, we consider the problem of a fault-tolerance Hamiltonian cycle passing through prescribed edges in hypercube Qn with some adjacently faulty vertices.. Let Fe ?} [r] ... See full document

... investigate the adjacent vertices fault-tolerance for bipancyclicity of ...contains the cycles of every even length from 4 to |V|. Let Fa be the set ... See full document

... discuss the edge fault tolerance for 2-pair spanning property for star ...be the n-dimensional star ...y2) of Sn ? Fe for any x1, x2 ? V1, y1, y2 ? V2 and Fe ?} E ... See full document

... on the hypercube with lower diameter'', IEEE Transactions on Computers, ...Journal of Combinatorial Theory, ...``Longest fault-free paths in Star Graphs with Vertex Faults,'' Theoretical ... See full document

... introduce the concepts of fault tolerant fanability. We show that the n-dimensional hypercube Qn are f-adjacent and l edges fault tolerant (n-f-l)*-fanable for ... See full document

... is the set of f (n–3) pairs of adjacent faulty vertices and (n–2–f) faulty ...is the set of f (n–3) pairs of adjacent faulty vertices and (n–3–f) ... See full document

... “Conditional fault-tolerant hamiltonicity of star graphs,” Parallel Computing, 33, ...“Longest fault-free paths in star graphs with vertex faults,” ...“Longest fault-free paths in star graphs ... See full document

... investigate the edge fault tolerance and adjacent vertex fault tolerance for some Hamiltonian property of the star ...be the set of fe faulty ... See full document

... is the set of f ?(n?4) pairs of adjacent faulty vertices, Sn?F is Hamiltonian where F is the set of f ?(n?3) pairs of adjacent faulty ...is the set ... See full document

... cycles of every even length from 4 to |V ...bipancyclic for F e ⊂ E(Q n ), |F e | ≤ n − ...vertex fault tolerant Hamiltonian properties of hypercube Q n = (V b ∪ V w , ...embedding ... See full document

... be the set of black faulty vertices of Q n and F w the set of white faulty vertices of Q n , F e the set of faulty edges of Q n ...denote ... See full document

... destination node. The routing algorithm, FROUTING, for a faulty n-cube is shown in Fig.. Lemma 3 and Theorem 2 formally present the above results. Any pair of adjacent 2-[r] ... See full document

... 1994). The formal definition of an n-cube is given below. For the sake of clarity, let a boldface letter u denote an n-bit binary string b n · · · b i · · · b 1 .... For 1 ≤ i ≤ ... See full document

... Several new algorithms for matrix-matrix multiplications on hypercube multiprocessors are presented and evaluated based on the number of multiplications, additions, and transfers.. Each[r] ... See full document

... The standard GSM HLR failure restoration procedure is not robust because the HLR may not contact the righl VLRs to access the updated loca- tion information. To idenlify the VLRs t[r] ... See full document