Standard Name for a vertex removal like operation
This operation is called vertex elimination. See for example: &quot;Triangulated Graphs and the Elimination Process&quot;, by Rose (1970).
This type of operation is well-studied, among others, in the context of chordal graphs (see Wikipedia entry about perfect elimination orderings). A related problem of finding an optimal ordering for applying this operation is called Minimum Fill-in.