Matching Preclusion for Augmented k-ary n-cubes

摘要

The(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 find this number and classify all optimal sets for the augmented k-ary n-cubes with even k ≥4.