| 循环图中部分图类的导出匹配可扩性 |
| |
| 引用本文： | 全焕,张晓东.循环图中部分图类的导出匹配可扩性[J].河南科学,2008,26(1):15-18. |
| |
| 作者姓名： | 全焕 张晓东 |
| |
| 作者单位： | 1. 平顶山工学院,基础部,河南,平顶山,467001
2. 河南质量工程职业学院,河南,平顶山,467001 |
| |
| 摘 要： | 如果一个图的任何一个导出匹配都能包含在一个完美匹配当中,就称之为导出匹配可扩的.对有2n个顶点x1,x2,…,x2n的图,如果对于i-j≡±1(mod2n)或者i-j≡±k(mod2n)的i和j,均有xixj∈E(G,)则称其为步长为1和k的循环图,记为C2n(1,k.)通过详细讨论循环图的导出匹配可扩性,具体给出了循环图中的部分图类的导出匹配可扩性。
|
| 关 键 词： | 导出匹配 完美匹配 可扩的 循环图 |
| 文章编号： | 1004-3918（2008）01-0015-04 |
| 收稿时间： | 2007-09-19 |
| 修稿时间： | 2007年9月19日 |
The Induced Matching Extendibility of some Graphs in Cyclic Graph |
| |
| QUAN Huan,ZHANG Xiao-dong.The Induced Matching Extendibility of some Graphs in Cyclic Graph[J].Henan Science,2008,26(1):15-18. |
| |
| Authors: | QUAN Huan ZHANG Xiao-dong |
| |
| Institution: | 1.Pingdingshan Institute of Technology;Pingdingshan 467001;China;2.Henan Quality Polytechnic;China |
| |
| Abstract: | A simple graph G is called as the induced matching extendable,if any induced matching of G can be included in a perfect matching of G.The cyclic graph which step length is 1 and k,denoted by C2n(1,k),is the graph with 2n vertices x1,x2,…,x2n,such that xixj is an edge of C2n(1,k) if either i-j ≡ ±1(mod 2n)or i-j ≡± k(mod 2n).In this paper the induced matching extendibility of cyclic graph is discussed.We give the IM-extendablity of some graphs in cyclic graphs. |
| |
| Keywords: | induced matching perfect matching IM-extendible cyclic craph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
