A lexicographic product of graphs G and H, denoted by is defined as a graph with the vertex set and an edge presents in the product whenever or (u 1 = u 2 and ). We investigate the sufficient conditions for vertex pancyclicity of lexicographic products of complete graphs Kn , paths Pn or cycles Cn with a general graph. We obtain that (i) if G 1 is a traceable graph of even order and G 2 is a graph with at least one edge, then is vertex pancyclic; (ii) if G 1 is hamiltonian and G 2 is a graph with at least one edge, then is vertex pancyclic.