𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Matching preclusion and conditional matching preclusion for regular interconnection networks

✍ Scribed by Eddie Cheng; Marc J. Lipman; László Lipták

Book ID
116401259
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
350 KB
Volume
160
Category
Article
ISSN
0166-218X

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