A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Matching preclusion for cube-connected cycles

2015
*
Discrete Applied Mathematics
*

Matching preclusion is a measure of robustness in the event of edge failure in interconnection networks. The matching preclusion number of a graph $G$ with even order is the minimum number of edges whose deletion results in a graph without perfect matchings and the conditional matching preclusion number of $G$ is the minimum number of edges whose deletion leaves the resulting graph with no isolated vertices and without perfect matchings. We consider matching preclusion of cubeconnected cycles

doi:10.1016/j.dam.2015.04.001
fatcat:7qcau2l4xjej7dh2c4nudqinuq