Let and be two undirected graphs, be an edge of , and be an edge of .
For example, let and each be a complete graph on four vertices; because of the symmetry of these graphs, the choice of which edge to select from each of them is unimportant.