Transitive distance-regular graphs from linear groups $L(3,q)$, $q = 2,3,4,5$
نویسندگان
1 Department of Mathematics, University of Rijeka, Croatia
doi
10.22108/toc.2020.116255.1630چکیده
In this paper we classify distance-regular graphs, including strongly regular graphs, admitting a transitive action of the linear groups $L(3,2)$, $L(3,3)$, $L(3,4)$ and $L(3,5)$ for which the rank of the permutation representation is at most 15. We give details about constructed graphs. In addition, we construct self-orthogonal codes from distance-regular graphs obtained in this paper.
