多部图的导出匹配可扩性(英文)  

The IM-Extendability of a Mutpl-Partite Graphs

作　　者：闫运生[1] 

机构地区：[1]河南工业大学理学院,郑州450001

出　　处：《河南科学》2011年第2期139-140,共2页Henan Science

基　　金：support by Henan Natural Science Foundation(10601051)and Henan University of Technology

摘　　要：k-部图G指图的顶点集V(G)被剖分成k个子集,使每一条边所关联的两个顶点不在同一个子集之中.主要研究了完全多部图的导出匹配可扩性,给出了完全多部图是导出匹配可扩图的充要条件.A k-partite graph is one whose set can be partitioned into k subsets so that no edge has both ends in any one subset.The IM-Extendability of the complete k-partite graph is mainly studied in this paper,and the necessary and sufficient condition of the IM-Extendability of the complete k-partite graph is obtained.

关 键 词：完美匹配 导出匹配 导出匹配可扩图 联图 

分 类 号：O175.5[理学—数学]