运用图的最优填充分解定理,将强乘积图P3×Pn,P2×Pn与乘积图P2×Pn^2进行分解,得到了它们的最优填充数.
By using the decomposition theorem for the fill- in of graphs, we can deeomposite the strong product of graphs together with product graph, and obtain the fill - in number of them.