导出匹配,极大导出匹配可扩图和导出匹配数

摘要

目前我们已知的极大导出匹配可扩图只有Kn, n和K2n. 为了研究它们是否是仅有的极大导出匹配可扩图,我们考虑了匹配数,导出匹配数,极大导出匹配可扩图以及一个相关的猜想,并得出了若干相关的结果.%The only connected maximal IM-extendable graphs that we know now are Kn,n and K2n. Since we want to know whether they are the only connected maximal IM-extendable graphs, we consider the matching number, the IM number, the maximal IM-extendable graphs.