Pretražite po imenu i prezimenu autora, mentora, urednika, prevoditelja

Napredna pretraga

Pregled bibliografske jedinice broj: 1048188

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


Švob, Andrea
Transitive distance-regular graphs from linear groups L(3, q), q=2, 3, 4, 5 // Transactions on combinatorics, 9 (2020), 1; 49-60 doi:10.22108/toc.2020.116255.1630 (međunarodna recenzija, članak, znanstveni)


CROSBI ID: 1048188 Za ispravke kontaktirajte CROSBI podršku putem web obrasca

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

Autori
Švob, Andrea

Izvornik
Transactions on combinatorics (2251-8657) 9 (2020), 1; 49-60

Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni

Ključne riječi
strongly regular graph ; distance-regular graph ; linear group ; self-orthogonal code

Sažetak
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.

Izvorni jezik
Engleski

Znanstvena područja
Matematika



POVEZANOST RADA


Projekti:
HRZZ-IP-2018-01-6732 - Kombinatorički objekti i kodovi (COCo) (Crnković, Dean, HRZZ ) ( CroRIS)

Ustanove:
Sveučilište u Rijeci, Fakultet za matematiku

Profili:

Avatar Url Andrea Švob (autor)

Poveznice na cjeloviti tekst rada:

doi toc.ui.ac.ir toc.ui.ac.ir

Citiraj ovu publikaciju:

Švob, Andrea
Transitive distance-regular graphs from linear groups L(3, q), q=2, 3, 4, 5 // Transactions on combinatorics, 9 (2020), 1; 49-60 doi:10.22108/toc.2020.116255.1630 (međunarodna recenzija, članak, znanstveni)
Švob, A. (2020) Transitive distance-regular graphs from linear groups L(3, q), q=2, 3, 4, 5. Transactions on combinatorics, 9 (1), 49-60 doi:10.22108/toc.2020.116255.1630.
@article{article, author = {\v{S}vob, Andrea}, year = {2020}, pages = {49-60}, DOI = {10.22108/toc.2020.116255.1630}, keywords = {strongly regular graph, distance-regular graph, linear group, self-orthogonal code}, journal = {Transactions on combinatorics}, doi = {10.22108/toc.2020.116255.1630}, volume = {9}, number = {1}, issn = {2251-8657}, title = {Transitive distance-regular graphs from linear groups L(3, q), q=2, 3, 4, 5}, keyword = {strongly regular graph, distance-regular graph, linear group, self-orthogonal code} }
@article{article, author = {\v{S}vob, Andrea}, year = {2020}, pages = {49-60}, DOI = {10.22108/toc.2020.116255.1630}, keywords = {strongly regular graph, distance-regular graph, linear group, self-orthogonal code}, journal = {Transactions on combinatorics}, doi = {10.22108/toc.2020.116255.1630}, volume = {9}, number = {1}, issn = {2251-8657}, title = {Transitive distance-regular graphs from linear groups L(3, q), q=2, 3, 4, 5}, keyword = {strongly regular graph, distance-regular graph, linear group, self-orthogonal code} }

Časopis indeksira:


  • Web of Science Core Collection (WoSCC)
    • Emerging Sources Citation Index (ESCI)
  • Scopus


Citati:





    Contrast
    Increase Font
    Decrease Font
    Dyslexic Font