| 关于乘积图的导出匹配划分数 |
| |
| 引用本文： | 侯亚林,丁锐. 关于乘积图的导出匹配划分数[J]. 华北水利水电学院学报(社会科学版), 2009, 25(5): 100-102 |
| |
| 作者姓名： | 侯亚林 丁锐 |
| |
| 作者单位： | [1]黄淮学院数学科学系,河南驻马店463000 [2]华北水利水电学院,河南郑州450011 |
| |
| 基金项目： | 河南省重点科技攻关项目（072102340009）; 河南省哲学社会科学规划项目（2007BJJ014）; 河南省科技厅软科学研究计划项目（08240044010）; 河南省教育厅自然科学基础研究计划项目（2009A110011） |
| |
| 摘 要： | 图G的导出匹配划分数是图论中研究的热点问题.针对乘积图的导出匹配划分数进行了研究,给出了乘积图的导出匹配划分数的一个下界和一个上界,对一些特殊图类的乘积图,还给出了其导出匹配划分数的精确结果,可为相关研究参考.
|
| 关 键 词： | 导出匹配 划分 着色 乘积图 |
The Induced Matching Partition Number of Product Graphs |
| |
| HOU Ya-lin,DING Rui. The Induced Matching Partition Number of Product Graphs[J]. Journal of North China Institute of Water Conservancy and Hydroelectric Power(Social Sciences Edition), 2009, 25(5): 100-102 |
| |
| Authors: | HOU Ya-lin DING Rui |
| |
| Affiliation: | 1.Department of Mathematic Science,Huanghuai College,Zhumadian 463000,China;2.North China Institute of Water Conservancy and Hydroelectric Power,Zhengzhou 450011,China) |
| |
| Abstract: | The induced matching partition number of graph G is an important problem for graph theory.The induced matching partition number of product graphs was studied,a lower bound and an upper bound for the induced matching partition number of product graphs were given,and exact results are given for some special product graphs.These provid some references for similar studies. |
| |
| Keywords: | induced matching partition coloring product graph |
| 本文献已被 维普 等数据库收录！ |
