Iterating over all non isomorphic connected graphs of given order
I would like to iterate over all connected non isomorphic graphs and test some properties. For all the graphs on less than 11 vertices I've used the data available in graph6 format here.
Now I would like to test the results on at least all connected graphs on 11 vertices.
Looking at the documentation I've found that there is a graph database in sage. However, trying just the first example resulted in some errors :
Traceback (most recent call last)
/home/a/<ipython console=""> in <module>()
/usr/lib/sage/local/lib/python2.7/site-packages/sage/databases/sql_db.pyc in show(self, **kwds) 664 cur.execute(self.__query_string__, self.__param_tuple__) 665 except: --> 666 raise RuntimeError('Failure to fetch query.') 667 668 print _create_print_table(cur, [des for des in cur.description], \
RuntimeError: Failure to fetch query.
What I would like to ask is the following:
Is there a way to iterate over all connected (nonisomorphic) graphs of order 11?
Is there a databse for these graphs already present in sage?
Has anyone considered integrating (and extending) the data from McKay's site into sage?