𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Strong matching preclusion for torus networks

✍ Scribed by Wang, Shiying; Feng, Kai

Book ID
122314018
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
584 KB
Volume
520
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Strong matching preclusion
Strong matching preclusion
✍ Jung-Heum Park; Insung Ihm πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 393 KB
Strong matching preclusion for augmented
Strong matching preclusion for augmented cubes
✍ Cheng, Eddie; Shah, Shalin; Shah, Vyom; Steffy, Daniel E. πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 347 KB
Strong matching preclusion for -ary -cub
Strong matching preclusion for -ary -cubes
✍ Wang, Shiying; Feng, Kai; Zhang, Guozhen πŸ“‚ Article πŸ“… 2013 πŸ› Elsevier Science 🌐 English βš– 420 KB
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