Mutual Embeddings


This paper introduces a type of graph embedding called a mutual embedding. A mutual embedding between two n-node graphs G1 = (V1, E1) and G2 = (V2, E2) is an identification of the vertices of V1 and V2, i.e., a bijection π : V1 → V2, together with an embedding of G1 into G2 and an embedding of G2 into G1 where in the embedding of G1 into G2, each node u of… (More)
DOI: 10.1142/S0219265915500012


7 Figures and Tables

Slides referencing similar topics