 The lexicographic product was first studied by .As showed, the problem of recognizing whether a graph is a lexicographic product is equivalent in complexity to the graph isomorphism problem.The lexicographic product is in general noncommutative