**Motivation**: I want to see how the 3-dimensional Weisfeiler-Lehman algorithm (see [Logical complexity of graphs](http://arxiv.org/PS_cache/arxiv/pdf/1003/1003.4865v1.pdf), p. 14) distinguishes between two non-isomorphic [strongly regular graphs srg(v,k,λ,μ)](http://en.wikipedia.org/wiki/Strongly_regular_graph) in a specific example.



> 
> **Question**: What are the smallest non-isomorphic strongly regular graphs
>  with the same v,k,λ,μ?
> 
> 
> 



Smallest non-isomorphic strongly regular graphs
This page <http://www.maths.gla.ac.uk/~es/srgraphs.html> lists some strongly regular graphs on few vertices, and gives two (16,6,2,2) graphs (which I didn't check but I presume they're non-isomorphic). I imagine they're the smallest possible but I haven't checked: <http://www.maths.gla.ac.uk/~es/16.vertices>


