And represented 10.3 isomorphic graph (Graph Representations and Isomorphism)

And represented 10.3 isomorphic graph (Graph Representations and Isomorphism)

Diagram showing the

Adjacency list representation (Adjacency lists)

Adjacency matrix notation (Adjacency matrices)

Correlation matrix notation (Incidence matrices)

FIG isomorphic

Popular defined: two patterns are isomorphic, if and only if (IFF) in addition to their node names, they are the same.
Formal definition: the presence of bijections on the apex (bijection) between the function f G1 = (V1, E1) and G2 = (V2, E2): V1 -> V2, such that any of a, b∈V1, a and b have G1 adjacent, then f (a) and f (b) are adjacent G2
isomorphism == "isomorphic subgraphs must also