| 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[Vi] 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.
|
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(7) |
| |
| Authors: | Yalin Hou |
| |
| Abstract: | |
| |
| Keywords: | Induced matching partition coloring product graph |
|
|
