>
Fa   |   Ar   |   En
   transitive distance-regular graphs from linear groups l(3,q)‎, ‎q = 2,3,4,5  
   
نویسنده svob andrea
منبع transactions on combinatorics - 2020 - دوره : 9 - شماره : 1 - صفحه:49 -60
چکیده    In this paper we classify distance-regular graphs, including strongly regular graphs, ad- mitting 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.
کلیدواژه strongly regular graph ,distance-regular graph ,linear group ,self-orthogonal code
آدرس university of rijeka, department of mathematics, croatia
پست الکترونیکی asvobmath.uniri.hr
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved