Document Type

Journal Article

Department/Unit

Department of Mathematics

Language

English

Abstract

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 networkCCCn. By using the super-edge-connectivity of vertex-transitive graphs, the super cyclically edge-connectivity of CCCn 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 CCCn and classify respective optimal matching preclusion sets.

Keywords

Matching preclusion, Networks, Cube-connected cycles, Cyclically edge-connectivity

Publication Date

2015

Source Publication Title

Discrete Applied Mathematics

Volume

190-191

Start Page

118

End Page

126

Publisher

Elsevier

Peer Reviewed

1

DOI

10.1016/j.dam.2015.04.001

Link to Publisher's Edition

https://dx.doi.org/10.1016/j.dam.2015.04.001

ISSN (print)

0166218X

Included in

Mathematics Commons

Share

COinS