World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

Matching Preclusion for the Shuffle-Cubes

    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. P. Bonneville, E. Cheng and J. Renzi, Strong matching preclusion for the alternating group graphs and split-stars, Journal of Interconnection Networks 12(4) (2012) 277–298. LinkGoogle Scholar
    • 2. R. C. Brigham, F. Harary, E. C. Violin and J. Yellen, Perfect-matching preclusion, Congressus Numerantium 174 (2005) 185–192. Google Scholar
    • 3. E. Cheng, M. J. Lipman and L. Lipták, Matching preclusion and conditional matching preclusion for regular interconnection networks, Discrete Applied Mathematics 160(13) (2012) 1936–1954. Google Scholar
    • 4. T.-K. Li, J. J. M. Tan and L.-H. Hsu, 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. T.-K. Li, J. J. M. Tan, L.-H. Hsu and T.-Y. Sung, The shuffle-cubes and their generalization, Information Processing Letters 77 (2001) 35–41. Google Scholar
    • 6. J.-M. Xu, M. Xu and Q. Zhu, The super connectivity of shuffle-cubes, Information Processing Letters 96 (2005) 123–127. ISIGoogle Scholar
    • 7. M. Xu, X. Hu and S. Shang, The conditional diagnosability of shuffle-cubes, Journal of Systems Science and Complexity 23 (2010) 81–90. Google Scholar