摘要:
The Exchanged Hypercube network EH(s,t) is a new variant of the hypercube network,where integers s and t are both the dimension numbers with s≥1,t≥1.A new method namedt1/k diagnosis strategy,first proposed by Somani and Peleg,is a new strategy in which the fault set is allowed to contain at most t1+k nodes and among which exist at most k fault free nodes.In this paper,we study the t1/k diagnosability of the Exchanged Hypercube.Let Γ(G,V′) denote the number of vertices adjacent to a setV′ofk nodes in the Exchanged Hypercube G,and we obtain the result that Γ(G,V′)is k(s+1)-k(k+1)/2+1 at least for each integer k satisfying 1≤k≤s+2 and 1≤s≤t.Further we prove that Exchanged Hypercube EH(s,t) is t1(s,k)/k diagnosable when 1≤s≤t and 0≤k≤s+1,where t1(s,k)=(k+1)(s+1)(k+1)(k+2)/2+1.
展开