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

Napredna pretraga

Pregled bibliografske jedinice broj: 1110912

On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher


Bailey, Robert; Hawtin, Daniel
On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher // The Electronic journal of combinatorics, 27 (2020), 3; P3.13, 12 doi:10.37236/8954 (međunarodna recenzija, članak, znanstveni)


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

Naslov
On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher

Autori
Bailey, Robert ; Hawtin, Daniel

Izvornik
The Electronic journal of combinatorics (1077-8926) 27 (2020), 3; P3.13, 12

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

Ključne riječi
graph ; coset graph ; distance-regular graph

Sažetak
This paper considers three imprimitive distance-regular graphs with 486 vertices and diameter 4: the Koolen–Riebeek graph (which is bipartite), the Soicher graph (which is antipodal), and the incidence graph of a symmetric transversal design obtained from the affine geometry AG(5, 3) (which is both). It is shown that each of these is preserved by the same rank-9 action of the group 3^5:(2×M10), and the connection is explained using the ternary Golay code.

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 Daniel Robert Hawtin (autor)

Poveznice na cjeloviti tekst rada:

doi

Citiraj ovu publikaciju:

Bailey, Robert; Hawtin, Daniel
On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher // The Electronic journal of combinatorics, 27 (2020), 3; P3.13, 12 doi:10.37236/8954 (međunarodna recenzija, članak, znanstveni)
Bailey, R. & Hawtin, D. (2020) On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher. The Electronic journal of combinatorics, 27 (3), P3.13, 12 doi:10.37236/8954.
@article{article, author = {Bailey, Robert and Hawtin, Daniel}, year = {2020}, pages = {12}, DOI = {10.37236/8954}, chapter = {P3.13}, keywords = {graph, coset graph, distance-regular graph}, journal = {The Electronic journal of combinatorics}, doi = {10.37236/8954}, volume = {27}, number = {3}, issn = {1077-8926}, title = {On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher}, keyword = {graph, coset graph, distance-regular graph}, chapternumber = {P3.13} }
@article{article, author = {Bailey, Robert and Hawtin, Daniel}, year = {2020}, pages = {12}, DOI = {10.37236/8954}, chapter = {P3.13}, keywords = {graph, coset graph, distance-regular graph}, journal = {The Electronic journal of combinatorics}, doi = {10.37236/8954}, volume = {27}, number = {3}, issn = {1077-8926}, title = {On the 486-vertex distance-regular graphs of Koolen-Riebeek and Soicher}, keyword = {graph, coset graph, distance-regular graph}, chapternumber = {P3.13} }

Časopis indeksira:


  • Current Contents Connect (CCC)
  • Web of Science Core Collection (WoSCC)
    • Science Citation Index Expanded (SCI-EXP)
    • SCI-EXP, SSCI i/ili A&HCI
  • Scopus


Citati:





    Contrast
    Increase Font
    Decrease Font
    Dyslexic Font