| 步长为1和n/2循环图的导出匹配可扩性研究 |
| |
| 引用本文： | 徐华锋,尹红征,刘斌. 步长为1和n/2循环图的导出匹配可扩性研究[J]. 河南科学, 2006, 24(5): 638-640 |
| |
| 作者姓名： | 徐华锋 尹红征 刘斌 |
| |
| 作者单位： | 平顶山工学院,基础部,河南,平顶山,467001;河南农业大学,信息与管理科学学院,郑州,450002 |
| |
| 基金项目： | 河南省自然科学基金;河南省教育厅自然科学基金 |
| |
| 摘 要： | 如果一个图的任何一个导出匹配都能包含在一个完美匹配当中,就称之为导出匹配可扩的.对有2n个顶点x1,x2,…,x2n的图,如果对于i-j≡±1(mod2n)或者i-j≡±n2(mod2n)的i和j,均有xixj∈E(G),则称其为步长为1和n2的循环图,记为C2n(1,2n).本文的主要结论为:C2n(1,2n),n#4,是导出匹配可扩的.
|
| 关 键 词： | 导出匹配 完美匹配 可扩的 循环图 |
| 收稿时间： | 2006-05-27 |
Study on the Induced Matching Extendibility of Cyclic Graph with Step Length 1 and n/2 |
| |
| XU Hua-feng,YIN Hong-zheng,LIU Bin. Study on the Induced Matching Extendibility of Cyclic Graph with Step Length 1 and n/2[J]. Henan Science, 2006, 24(5): 638-640 |
| |
| Authors: | XU Hua-feng YIN Hong-zheng LIU Bin |
| |
| Abstract: | A simple graph G is called as the induced matching extendable,shortly IM-extendable,if every induced matching of G is included in a perfect matching of G.The cyclic graph with 2n vertices which step length are 1 and 1/2,denoted by C2n(1,1/2),is the graph with 2n vertices x1,x2,...,x2n,such that xi xj is an edge of C2n(1,1/2) if either i-j≡±1(mod 2n) or i-j≡±1/2(mod 2n).It is shown that C2n(1,1/2),n4 is IM-extendable. |
| |
| Keywords: | induced matching perfect matching IM-extendible cyclic graph |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
