Matching preclusion for cube-connected cycles

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 cube-connected cycles network CC^Cn. By using the super-edge-connectivity of vertex-transitive graphs, the super cyclically edge-connectivity of CC^Cn for n=3,4 and 5, Hall's Theorem and the strengthened Tutte's Theorem, we obtain the matching preclusion number and the conditional matching preclusion number of CC^Cn and classify respective optimal matching preclusion sets.