Join (thing)

Let G = (N,E) be a graph, and let x and y be distinct nodes of G that aren't joined by an edge. The graph G/xy formed by adding the edge (x,y) to G is called a join of G .

--back to combinatorics--