a $(v,k,\lambda,\mu)$-strongly regular graph (srg for short) is a finite undirected graph without loops or multiple edges such that (i) it has $v$ vertices, (ii) it is regular of degree $k$, (iii) each edge is in $\lambda$ triangles, (iv) any two nonadjacent points are joined by $\mu$ paths of length 2. the connectivity of a graph is the minimum number of vertices one has to remove in order to make it disconnected (or empty). in 1985, brouwer and mesner used seidel's characterization of strongly regular graphs with eigenvalues at least $-2$ to prove that the vertex-connectivity of any $(v,k,\lambda,\mu)$-srg equals its degree $k$. also, they proved that the only disconnecting sets of size $k$ are the neighborhoods $n(x)$ of a vertex $x$ of the graph. a natural question is what the minimum number of vertices whose removal will disconnect a $(v,k,\lambda,\mu)$-srg into non-singleton components. in 1996, brouwer conjectured that this number is $2k-\lambda-2$. in this talk, i will report some progress on this problem. this is joint work with kijung kim and jack koolen (postech, south korea).