6
$\begingroup$

Does anyone know of the link to an online library of of unlabeled, connected graphs on n vertices? I remember looking at such an archive a few years ago while at a Macaulay 2 workshop, but I've been unable to find it (or any other one) since then.

The page I remember seeing only had enumerated unlabeled graphs up to n=11,12, or 13 vertices, and the graph I'm looking for data on is much larger, so links to repositories of larger (special) graphs.

The most specific part of this request: The graph I'm looking to find a list of edges for is the 1-skeleton of the 600-cell, if anyone happens to just have that information on-hand (or readily available.)

$\endgroup$

3 Answers 3

4
$\begingroup$

Is this it? It is a searchable database of "Small Simple Graphs: Connected, undirected, and unlabeled."

And an explicit list of the vertices, edges, and faces of the 600-cell can be found at Paul Bourke's site.

$\endgroup$
2
  • $\begingroup$ That list of vertices and edges was precisely what I was looking for. $\endgroup$ Nov 17, 2010 at 19:10
  • $\begingroup$ Ugh, although in an AWFUL format for what I need it for. $\endgroup$ Nov 17, 2010 at 19:11
2
$\begingroup$

Is it possible that this is what you remember seeing? http://wwwteo.informatik.uni-rostock.de/isgci/smallgraphs.html

$\endgroup$
1
$\begingroup$

You can use the geng tool that comes as part of nauty here, or grab a list of graphs on up to 10 vertices here (it also has some special classes). It's unlikely you will be able to fit a file of all 50502031367952 graphs on 13 vertices on your computer!

$\endgroup$
2
  • $\begingroup$ I certainly didn't want the entire list of them - just was hoping that a website archive of these graphs would have the particular one I was looking for as part of their esoterica! $\endgroup$ Nov 17, 2010 at 19:09
  • $\begingroup$ Those were the two websites I'd been looking at then and couldn't relocate. Thanks for the links! $\endgroup$ Nov 17, 2010 at 19:20

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.