|
|||||
|
|
| Some results on the Induced Matching Partition Number of Product Graphs | |
| 摘 要： | |
Some results on the Induced Matching Partition Number of Product Graphs |
|
| Authors: | Yalin Hou |
| Abstract: | 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),GVi]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. |
| Keywords: | Induced matching partition coloring product graph |
| 本文献已被 万方数据 等数据库收录！ | |