Edge-fault-tolerant diameter and bipanconnectivity of hypercubes
Let n(>= 3) be a given integer and Omega(k) = {l vertical bar k  = 2 and vertical bar F vertical bar  = 2, and s = h + 4 otherwise. Hence, the diameter of the graph Q(n) - F is n. Our results improve some previous results. (C) 2010 Elsevier B.V. All rights reserved.F
bipanconnectivity hypercube path embedding fault tolerance fault-tolerant diameter interconnection networks