Consider two graphs, G and G2. Let the vertices of G be labelled using the letters...

 

Transcribed Image Text:

Consider two graphs, G and G2. Let the vertices of G be labelled using the letters A-F. The adjacency matrix for G is the following, where vertex A is represented by the first row and column, vertex B is represented by the second row and column, and so on. [0 1 1 1 0 0 1 0 0 0 0 1 1 0 0 1 10 1 0 1 0 1 1 0 0 1 1 00 0 1 0 1 0 0 The adjacency list for G2 is the following. A D, F B C, E, F C B, F D A, E E B, D, F F A, B, C, E Are the graphs G and G2 isomorphic? If so, provide an explicit mapping from the vertices of G to the vertices of G2. If not, explain how you can tell. Consider two graphs, G and G2. Let the vertices of G be labelled using the letters A-F. The adjacency matrix for G is the following, where vertex A is represented by the first row and column, vertex B is represented by the second row and column, and so on. [0 1 1 1 0 0 1 0 0 0 0 1 1 0 0 1 10 1 0 1 0 1 1 0 0 1 1 00 0 1 0 1 0 0 The adjacency list for G2 is the following. A D, F B C, E, F C B, F D A, E E B, D, F F A, B, C, E Are the graphs G and G2 isomorphic? If so, provide an explicit mapping from the vertices of G to the vertices of G2. If not, explain how you can tell.