Naslov
Strongly regular graphs constructed from groups

Autori
Crnković, Dean

Vrsta, podvrsta i kategorija rada
Sažeci sa skupova, sažetak, znanstveni

Izvornik
Symmetry vs. Regularity, Abstracts / Ivanov, Alexandar A. ; Klin, Mikhail ; Munemasa, Akihiro ; Nedela, Roman - Plzeň : Union of Czech Mathematicians and Physicists and Universiy of West Bohemia in Pilzen, 2018, 23-23

ISBN
978-80-261-0806-1

Skup
Symmetry vs Regularity

Mjesto i datum
Plzeň, Češka Republika, 01.07.2018. - 07.07.2018

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
strongly regular graph ; finite group ; linear code

Sažetak
A construction of 1-designs determined by a transitive action of a finite group is given in [1]. Under certain conditions the incidence matrix of a constructed 1-design is symmetric with zero diagonal, i.e. this matrix is the adjacency matrix of a regular graph. Using this method we construct a number of strongly regular graphs, including the first known examples of strongly regular graphs with parameters (216, 40, 4, 8) and (540, 187, 58, 68). This construction also leads to a construction of some distance-regular graphs with diameter greater than 2. Further, we discuss linear codes obtained from the constructed graphs. The obtained codes usually have large automorphism groups, hence they are suitable for permutation decoding. REFERENCES [1] D. Crnković, V. Mikulić Crnković, A. Švob, On some transitive combinatorial structures constructed from the unitary group U(3, 3), J. Statist. Plann. Inference 144 (2014), 19-40.

Izvorni jezik
Engleski

Znanstvena područja
Matematika

POVEZANOST RADA