Isomorphism of two graphs using adjacency matrix How can I show that the following two graphs are isomorphic:

Steps:
The given graphs can be written as:


I am keeping this answer as simple as I can, so kindly pardon the layman's language. 
Observe the to graphs,
From G1, G2 can be obtained if the first line and second line of the graph G1 are interchanged. So, this graph is definitely iso-"morphic". (bijective and satisfies the edge adjacency property). And the mapping would be v6 -> w1, v1 -> w5 and v2 -> w6, rest being pretty straight forward mapping. These mappings satisfy the isomorphic property, hence it should be isomorphic.
