# Name for a type of subgraph that comes from identification of vertices?

Is there a special name for the kind of subgraphs you get by taking some sequence of the following operation: Pick two vertices and identify them so all edges going to either vertex get sent to the new vertex.

-
Note that if you contract only adjacent vertices of a graph $G$ you obtain a minor of $G$. –  Jernej Jul 17 '12 at 6:48
Here is link to Wikipedia article on minors mentioned in Azoo's comment. –  Martin Sleziak Jul 17 '12 at 12:28
I'm actually doing the opposite here and only contracting vertices which are not adjacent. My graph is the Hasse graph of a ranked poset and my identifications take place between vertices of the same rank. –  user1390 Jul 18 '12 at 3:52