In combinatorics, the graph G:xy formed by replacing distinct nodes x and y with a single new node z which is connected to any nodes that were connected to either x or y is called a contraction of G .

--back to combinatorics--