  We provide an abundance of strongly regular graphs (SRGs) for certain
parameters $(n, k, \lambda, \mu)$ with $n < 100$. For this we use Godsil-McKay
(GM) switching with a partition of type $4,n-4$ and Wang-Qiu-Hu (WQH) switching
with a partition of type $3^2,n-6$. In most cases, we start with a highly
symmetric graph which belongs to a finite geometry. To our knowledge, most of
the obtained graphs are new.
  For all graphs, we provide statistics about the size of the automorphism
group. We also find the recently discovered Kr\v{c}adinac partial geometry,
therefore finding a third method of constructing it.
