A Concise Survey of Matching Preclusion in Interconnection Networks.
JOURNAL OF INTERCONNECTION NETWORKS(2019)
摘要
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. There are other related parameters and generalization including the strong matching preclusion number, the conditional matching preclusion number, the fractional matching preclusion number, and so on. In this survey, we give an introduction on the general topic of matching preclusion.
更多查看译文
关键词
Perfect matching,matching preclusion
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络