| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6876303 | Theoretical Computer Science | 2013 | 7 Pages |
Abstract
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 perfect matchings. The concept was 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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Eddie Cheng, Shalin Shah, Vyom Shah, Daniel E. Steffy,