To add to the answer of user108903, to prove two graphs are not isomorphic, you need to find some graph property that one has but the other doesn't. Sometimes this is easy and sometimes this is not (sometimes it's as easy as showing their degree sequences are different). user108903's suggestion here is to see which ones are bipartite. In this case, that works to show Graph 3 is not isomorphic to 1 or 2. An equivalent way would be to find the chromatic numbers of the graphs. If you look at a graph theory textbook on this subject, there will probably be a few examples where they show different ways to prove two graphs are non-isomorphic. I know Graphs and Digraphs by Chartrand, et al, does.
Another way that would work here would be to look at the independence numbers of the graphs. I think that finding the largest induced cycle would also do the trick. I believe you can find one of length 5 in graph 3, whereas you can not find one of odd order in any bipartite graph, to go back to the hint of user108903.
To show that two graphs are actually isomorphic, you need to construct an isomorphism from one to the other. So, construct a map from graph 1 to 2 that preserves adjacency/non-adjacency. There is not some finite list of properties you can check to determine if two graphs are isomorphic, as far as I know.