The number of vertices and edges are same, with each vertex having the same degree and the degree sequence of the graph is also the same. I have even tried finding a bipartite graph in any one of them even that seems to fail.
Question- How to show the three graphs with degree sequence [3,3,3,3,3,3,3,3,3,3] are non isomorphic (see figure)?

Count the number of quadrilaterals and the number of pentagons in each graph. ( 4-cycles and 5-cycles )
You will come up with different numbers which indicate these are not isomorphic graphs.