\input zb-basic
\input zb-ioport
\iteman{io-port 06085244}
\itemau{Cheng, Eddie; Hu, Philip; Jia, Roger; Lipt\'ak, L\'aszl\'o}
\itemti{Matching preclusion and conditional matching preclusion for bipartite interconnection networks. II: Cayley graphs generated by transposition trees and hyper-stars.}
\itemso{Networks 59, No. 4, 357-364 (2012).}
\itemab
Summary: The matching preclusion number of a graph with an even number of vertices is the minimum number of edges whose deletion results in a graph that has no perfect matchings. For many interconnection networks, the optimal sets are precisely those induced by a single vertex. It is natural to look for obstruction sets beyond those induced by a single vertex. The conditional matching preclusion number of a graph is the minimum number of edges whose deletion results in a graph with no isolated vertices that has no perfect matchings. In this companion paper of {\it E. Cheng} et al. [Networks 59, No. 4, 349--356 (2012; Zbl 06085243)], we find these numbers for a number of popular interconnection networks including hypercubes, star graphs, Cayley graphs generated by transposition trees and hyper-stars.
\itemrv{~}
\itemcc{}
\itemut{interconnection networks; perfect matching; Cayley graphs; hyper-stars}
\itemli{doi:10.1002/net.20441}
\end