Matching preclusion for some interconnection networks

descriptionPublicationkeyboard_double_arrow_right Article 14 Jun 2007 English Publisher:WileyJournal:Networks, volume 50, pages 173-180 (issn: 0028-3045, eissn: 1097-0037,

Copyright policy )

Authors: Eddie Cheng 0001; László Lipták;

doi: 10.1002/net.20187

Matching preclusion for some interconnection networks

- Summary
- Metrics

Abstract

AbstractThe 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

Related Organizations

Oakland University
United States

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	81
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 1%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%