一些特殊图类的导出匹配划分数  

The Induced Matching Partition Number of Some Special Graphs

作　　者：徐华锋[1] 李玲玲[1] 

机构地区：[1]平顶山工学院,河南平顶山467001

出　　处：《平顶山工学院学报》2006年第2期51-52,共2页Journal of Pingdingshan Institute of Technology

摘　　要：文章讨论了循环图G2n(1,k)中的一些特殊图类的导出匹配划分数,当k=2,3,4,n,n-1时,具体给出了这些图的导出匹配划分数。The induced ,matching partition number of a graph G, demoted by imp（G）, is the minimum integer k such that V（G） has a k - partition（V1 ,V2,L,Vk）such that, for each i,i（1≤i≤k）,g[Vi]the subbraph of G induced by V1, is a 1 - regular graph. In this paper, the induced matching partition number of some special graphs in C2H（1,k） are discussed. When k= 2,3,4,n,n- 1,the induced matching partition numbers of Con （ 1, k） have been given.

关 键 词：完美匹配 导出匹配 划分数 

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