title: Terminology graphs with loops
body: <p>I'm working on a project in which we use a type of undirected graphs where loops (an edge from a vertex to itself) but NOT parallel edges (multiple edges with the same end vertices), and I was wondering if there exists a name for these types of graphs. </p>
  
  <p>I noticed that in the case where parallel edges are allowed, some authors make the distinction between 'multigraphs' and 'pseudographs' to denote whether or not loops are permitted, but I have never seen such a distinction when multiple edges are not allowed.</p>
  
  <p>If anyone has ever come across such a name, I would be gratefull, because it will probably look better than "Let G be a graph that is permitted to have loops".</p>