Strong matching preclusion for augmented cubes

  title={Strong matching preclusion for augmented cubes},
  author={Eddie Cheng and Shalin Shah and Vyom Shah and Daniel E. Steffy},
  journal={Theor. Comput. Sci.},
The strong matching preclusion number of a graph is the minimum number of vertices and edges whose deletion results in a graph that has neither perfect matchings nor almost perfectmatchings. The conceptwas introduced by Park and Son. In this paper, we study the strong matching preclusion problem for the augmented cube graphs. As a result, we find smp(AQn) and classify all optimal solutions. © 2013 Elsevier B.V. All rights reserved.