simple graph theory terminology question

This is a probably a no brainer, and I've b开发者_开发问答een searching but can't seem to find an answer. What is the term (and any alternate terms) for a graph with only two vertices and only one edge between them?

This is not a homework question :-)

The complete graph on 2 vertices. Denoted K₂. See: http://en.wikipedia.org/wiki/Complete_graph

I don't know if an exact term exists, however it is a bipartite complete planar graph with 2 vertices for sure.

From further reading I found Regular Graph entry on wikipedia. It would seem to be a "1-regular graph", though there are other graphs which also qualify as such.