The vulnerability of the diameter of the enhanced hypercubes

Concern about fault tolerance in the design of interconnection networks has raised interest in the study of graphs such that deleting some vertices increases the diameter only moderately. For an interconnection network G, the (ω−1)-fault diameter Dω(G) is the maximum diameter of a subgraph obtained by deleting fewer than ω vertices of G, and the ω-wide diameter dω(G) is the least ℓ such that any two vertices are joined by ω internally-disjoint paths of length at most ℓ. The enhanced hypercube Qn,k is a variant of the well-known n-dimensional hypercube Qn in which an edge is added from each vertex xn,…,x1 to the vertex obtained by complementing xk,…,x1. Yang, Chang, Pai, and Chan gave an upper bound for dn+1(Qn,k) and Dn+1(Qn,k) and posed the problem of finding the wide diameter and fault diameter of Qn,k. By constructing internally disjoint paths between any two vertices in the enhanced hypercube, for n≥3 and 2≤k≤n we prove that Dω(Qn,k)=dω(Qn,k)=d(Qn,k) for 1≤ω