Matching preclusion for k-ary n-cubes

AbstractThe (conditional) matching preclusion number of a graph is the minimum number of edges whose deletion leaves a resulting graph (with no isolated vertices) that has neither perfect matchings nor almost perfect matchings. In this paper, we prove that the matching preclusion number and the conditional matching preclusion number of the k-ary n-cube with even k≥4 are 2n and 4n−2, respectively