Unique naming/labeling of $40$-node strongly regular graphs Brendan McKay's webpage lists all possible $40$-node strongly regular graphs. Is there a standard  way to name them uniquely?
 A: This may not be exactly what you had in mind, but in the context of displaying information on web pages, there is a need for a canonical labelling of graph isomorphism classes.
The proposed web standard is here.  As is typical with these things, the standards are debated for some years before they may be accepted, but this one seems relatively stable.  Code for evaluating it (which also allows you to examine the implementation of the algorithm) is here.  In terms of a "standard way" of naming these things, this is about as standard as you can get.
The graph isomorphism portion of the RDF specification is an attempt to answer your question (for any graph).  Since we're considering 40-node strongly regular graphs and there's only 28 of them, you could also encode them in some fashion and sort lexicographically.  But both these approaches may fail on aesthetic grounds-- maybe we'd really like to describe some relationship between the isomorphism classes that characterizes them in a mathematically meaningful way.  Perhaps that's the real question?
