So im having trouble figuring out the answer in this problem. Everything seems ok (same number of vertices, degrees etc) but i would guess that they are NOT isomorphic because in the second graph there is path of length 2 between the 2 paths of length 1, while in the first this isnt the case
Is this assumption correct?
The graphs are not isomorphic, but not for the reason that you gave: there are $9$ paths of length $1$ in each graph, so the $2$ paths of length $1$ is not actually meaningful.
Here are several ways to show that they are not isomorphic.