We classify the real and strongly real conjugacy classes in GLn(q), SLn(q), PGLn(q), PSLn(q), and all quasi-simple covers of PSLn(q). In each case we give a formula for the number of real, and the number of strongly real, conjugacy classes.

We derive strong constraints on the automorphism groups of strongly regular (SR) graphs, resolving old problems motivated by Peter Cameron’s 1981 description of large primitive groups. Trivial SR graphs are the disjoint unions of cliques of equal size and their complements. Graphic SR graphs are the line-graphs of cliques and of regular bipartite cliques (complete bipartite graphs with equal pa...

In this paper, directed strongly regular graphs (DSRGs) are constructed by using semidirect products. The orbit condition in [3] has been weakened and gives rise to the construction of DSRGs. Moreover, a different is given for DSRG semidihedral groups.