Matching Preclusion for the Shuffle-Cubes
Abstract
The matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph that has neither perfect matchings nor almost perfect matchings. A graph is maximally matched if its matching preclusion number is equal to its minimum degree, and is super matched if the matching preclusion number can only be achieved by deleting all edges incident to a single vertex. In this paper, we determine the matching preclusion number and classify the optimal matching preclusion sets for the shuffle-cube graphs, a variant of the well-known hypercubes.
This paper was part of a project that reached the Regional Finals of the 2017 Siemens Competition.
References
- 1. , Strong matching preclusion for the alternating group graphs and split-stars, Journal of Interconnection Networks 12(4) (2012) 277–298. Link, Google Scholar
- 2. , Perfect-matching preclusion, Congressus Numerantium 174 (2005) 185–192. Google Scholar
- 3. , Matching preclusion and conditional matching preclusion for regular interconnection networks, Discrete Applied Mathematics 160(13) (2012) 1936–1954. Google Scholar
- 4. , Fault hamiltonicity of the shuffle-cubes, in Proceedings of the 19th Workshop on Combinatorial Mathematics and Computation Theory (
Kaohsiung, Taiwan ,March 2002 ), pp. 110–119. Google Scholar - 5. , The shuffle-cubes and their generalization, Information Processing Letters 77 (2001) 35–41. Google Scholar
- 6. , The super connectivity of shuffle-cubes, Information Processing Letters 96 (2005) 123–127. ISI, Google Scholar
- 7. , The conditional diagnosability of shuffle-cubes, Journal of Systems Science and Complexity 23 (2010) 81–90. Google Scholar


