An adjacent vertex distinguishing incidence coloring of graph $G$ is an incidence coloring of $G$ such that no pair of adjacent vertices meets the same set of colors. We obtain the adjacent vertex distinguishing incidence chromatic number of the Cartesian product of a path and a path, a path and a wheel, a path and a fan, and a path and a star.
