The cover pebbling number for lexicographicproduct graphs and some strong product graphs were determined.
对一个图而言，满足此条件的最小的自然数即为此图的覆盖数。
2
Bipartite graphs with P-regular endomorphism monoids are characterized. P-regularity of the endomorphism monoid of lexicographicproduct of graphs is discussed.