Is your adjacency matrix for a non-directed, unweighted graph? (all 0s and 1s and symmetrical about the main diagonal)

A correlation matrix usually shows how related things are. This will not give you what are directly connected.

My guess is the answer is no. I see no way that you could get an adjacency matrix from a correlation matrix; however, if you describe in more detail, perhaps we can help get the same result some other way.