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. Park and Ihm introduced the problem of strong matching preclusion under the condition that no isolated vertex is created as a result of faults. In this article, we find the conditional strong matching preclusion number for the pancake graph.
| Original language | English |
|---|---|
| Article number | 1 |
| Pages (from-to) | 1-13 |
| Number of pages | 13 |
| Journal | International Journal of Parallel, Emergent and Distributed Systems |
| Volume | 38 |
| Issue number | 1 |
| DOIs | |
| State | Published - 2023 |
Keywords
- Matching preclusion
- pancake graph