| Some results on the Induced Matching Partition Number of Product Graphs |
| |
| 摘 要： | The induced matching partition number of graph G is the minimum integer k such that there exists a k-partition （V1, V2,…,Vk） of V（G） such that, for each i（1≤i≤k）, G[V1] is 1-regular. In this paper, we study the induced matching partition number of product graphs. We provide a lower bound and an upper bound for the induced matching partition number of product graphs, and exact results are given for some special product graphs.
|
| 关 键 词： | 乘积图表 匹配划分数 整数 图论 |
| 文章编号： | 1672-7894（2007）07-195-02 |
Some results on the Induced Matching Partition Number of Product Graphs |
| |
| Yalin Hou. Some results on the Induced Matching Partition Number of Product Graphs[J]. The Science Education Article Collects, 2007, 0(7X): 195-196 |
| |
| Authors: | Yalin Hou |
| |
| Affiliation: | Department of Mathematic Science, Huanghuai College Henan Zhumadian 463000 |
| |
| Abstract: | |
| |
| Keywords: | Induced matching partition coloring product graph |
| 本文献已被 维普 等数据库收录！ |
|
