✦ LIBER ✦

Matching preclusion and conditional matching preclusion for bipartite interconnection networks I: Sufficient conditions

✍ Scribed by Eddie Cheng; Philip Hu; Roger Jia; László Lipták

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 113 KB
Volume: 59
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20440

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matching preclusion for some interconnec

Matching preclusion for some interconnection networks

✍ Eddie Cheng; László Lipták 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 253 KB

## Abstract 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. In this paper, we find this number for various classes of interconnection networks and classify all the optimal sol

Matching preclusion and conditional matc

Matching preclusion and conditional matching preclusion for bipartite interconnection networks II: Cayley graphs generated by transposition trees and hyper-stars

✍ Eddie Cheng; Philip Hu; Roger Jia; László Lipták 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 123 KB