G,H,K:Graph. G H H K G K

1

1. G: Graph 2. H: Graph 3. K: Graph 4. v1: Vertices(G)Vertices(H) 5. e1: Edges(G)Edges(H) 6. Bij(Vertices(G); Vertices(H); v1) 7. Bij(Edges(G); Edges(H); e1) 8. (v1,v1) o Incidence(G) = Incidence(H) o e1 9. vmap: Vertices(H)Vertices(K) 10. emap: Edges(H)Edges(K) 11. Bij(Vertices(H); Vertices(K); vmap) 12. Bij(Edges(H); Edges(K); emap) 13. (vmap,vmap) o Incidence(H) = Incidence(K) o emap vmap:(Vertices(G)Vertices(K)), emap:(Edges(G)Edges(K)). Bij(Vertices(G); Vertices(K); vmap) & Bij(Edges(G); Edges(K); emap) & (vmap,vmap) o Incidence(G) = Incidence(K) o emap Edges(G)Vertices(K)Vertices(K)

3 steps

About: