摘 要: | 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), GV1] 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.
|