Strong matching preclusion for kk-ary nn-cubes

The kk-ary nn-cube is one of the most popular interconnection networks for parallel and distributed systems. Strong matching preclusion that additionally permits more destructive vertex faults in a graph is a more extensive form of the original matching preclusion that assumes only edge faults. In this paper, we establish the strong matching preclusion number and all minimum strong matching preclusion sets for kk-ary nn-cubes with n≥2n≥2 and k≥3k≥3.