is mentioned by

Def G H == vmap:(Vertices(G)Vertices(H)), emap:(Edges(G)Edges(H)). Bij(Vertices(G); Vertices(H); vmap) & Bij(Edges(G); Edges(H); emap) & (vmap,vmap) o Incidence(G) = Incidence(H) o emap

[graph-isomorphic]

In prior sections: fun 1 list 1 mb nat mb list 1 mb list 2 graph 1 1

Try larger context: Graphs