A proper k-edge coloring of a graph G is called adjacent vertex distinguishing acyclic edge coloring if there is no 2-colored cycle in G and the color set of edges incident to u is not equal to the color set of edges incident to v,where uv ∈ E(G).The adjacent vertex distinguishing acyclic edge chromatic number of G,denoted by χαα(G),is the minimal number of colors in an adjacent vertex distinguishing acyclic edge coloring of G.In this paper we prove that if G(V,E)is a graph with no isolated edges,then χαα(G)≤32△.