Premium
Matching preclusion for some interconnection networks
Author(s) -
Cheng Eddie,
Lipták László
Publication year - 2007
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.20187
Subject(s) - interconnection , matching (statistics) , combinatorics , computer science , graph , mathematics , discrete mathematics , theoretical computer science , computer network , statistics
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 solutions. © 2007 Wiley Periodicals, Inc. NETWORKS, Vol. 50(2), 173–180 2007