Transitive distance-regular graphs from linear groups $L(3,q)$, $q = 2,3,4,5$

DOI10.22108/toc.2020.116255.1630zbMath1474.05389OpenAlexW3004524067MaRDI QIDQ4997217

Andrea Švob

Publication date: 28 June 2021

Full work available at URL: http://toc.ui.ac.ir/article_24401_2717675239d9099d8570ae8b307013ae.pdf

zbMATH Keywords

distance-regular graphstrongly regular graphself-orthogonal codelinear group

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Association schemes, strongly regular graphs (05E30) Group actions on combinatorial structures (05E18)

Uses Software

• GAP
• Magma
• Code Tables

Cites Work

• Distance-regular graphs
• On some transitive combinatorial structures constructed from the unitary group \(U(3,3)\)
• Distance regular graphs of diameter 3 and strongly regular graphs
• 3-designs from \(\text{PSL}(2,q)\)
• New strongly regular graphs from orthogonal groups \(O^+(6, 2)\) and \(O^-(6, 2)\)
• On some distance-regular graphs with many vertices
• Fundamentals of Error-Correcting Codes
• Transitive $t$-designs and strongly regular graphs constructed from linear groups $L(2,q)$, $q leq 23$
• Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item