title: Enumerating Graphs with Self-Loops
body: <p>Brendan McKay has already done the work for finding all non-isomorphic graphs of n variables that can be found here (under Simple Graphs): <a href="http://cs.anu.edu.au/~bdm/data/graphs.html">http://cs.anu.edu.au/~bdm/data/graphs.html</a></p>
  
  <p>I believe this was done using polya enumeration, which I understand the basics of. I would like to expand on this, and allow self loops in these graphs. So, i'd like to find all non-ismorphic graphs of n variables, including self loops. This will be directly used for another part of my code and provide a massive optimization. I'm just not quite sure how to go about it.</p>
  
  <p>To be clear, Brendan Mckay's files give all non ismorphic graphs, ie in edge notation, </p>
  
  <p>1-2 1-3</p>
  
  <p>is a graph with an edge between vertex 1 and 2, and 1 and 3. I want this list to also include self loops, ie:</p>
  
  <p>1-2 1-3 1-1</p>
  
  <p>or </p>
  
  <p>1-2 1-3 1-1 2-2</p>
  
  <p>I want the minimum number of graphs, so all non-ismorphic ones. How can I go about finding them, hopefully using the data Brendan McKay has available for simple graphs?</p>