A lower bound on the size of k-neighborhood in generalized cubes

摘要

The determination of the minimum size of a k-neighborhood (i.e., a neighborhood of a set of k nodes) in a given graph is essential in the analysis of diagnosability and fault tolerance of multicomputer systems. The generalized cubes include the hypercube and most hypercube variants as special cases. In this paper, we present a lower bound on the size of a k-neighborhood in n-dimensional generalized cubes, where 2n + 1 ⩽ k ⩽ 3n − 2. This lower bound is tight in that it is met by the n-dimensional hypercube. Our result is an extension of two previously known results.