As modern parallel computer systems continue to expand in scale and complexity, the likelihood of system failures becomes increasingly unavoidable, and thus the importance of fault tolerance is increasingly concerned. For an interconnection network G, the neighbor connectivity, denoted by \(\kappa _{NB}(G)\) , is the minimum number of vertices to remove for the network to become disconnected, empty, or complete upon removing their closed neighbors. It provides more precise evaluations of network reliability and fault-tolerance. In this paper, we determine the exact values of neighbor connectivity of divide-and-swap cube as follows \(:\kappa _{NB}(DSC_{n})=\lceil \frac{d+1}{2} \rceil \) , where \(n=2^d\) with \(d\ge 1\) .