Transitive distance-regular graphs from linear groups $L(3,q)$, $q = 2,3,4,5$
Author(s):
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
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.
* The formula is not displayed correctly!
Keywords:
Language:
English
Published:
Transactions on Combinatorics, Volume:9 Issue: 1, Mar 2020
Pages:
49 to 60
https://www.magiran.com/p2103328