Pregled bibliografske jedinice broj: 945319
Enumeration of Strongly Regular Graphs on up to 50 Vertices Having S3 as an Automorphism Group
Enumeration of Strongly Regular Graphs on up to 50 Vertices Having S3 as an Automorphism Group // Symmetry, 10 (2018), 6; 212, 11 doi:10.3390/sym10060212 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 945319 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
Enumeration of Strongly Regular Graphs on up to 50
Vertices Having S3 as an Automorphism Group
Autori
Maksimović, Marija
Izvornik
Symmetry (2073-8994) 10
(2018), 6;
212, 11
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
strongly regular graph ; automorphism group ; orbit matrix
Sažetak
One of the main problems in the theory of strongly regular graphs (SRGs) is constructing and classifying SRGs with given parameters. Strongly regular graphs with parameters (37, 18, 8, 9), (41, 20, 9, 10), (45, 22, 10, 11), (49, 24, 11, 12), (49, 18, 7, 6) and (50, 21, 8, 9) are the only strongly regular graphs on up to 50 vertices that still have to be classified. In this paper, we give the enumeration of SRGs with these parameters having S3 as an automorphism group. The construction of SRGs in this paper is a step in the classification of SRGs on up to 50 vertices.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
POVEZANOST RADA
Projekti:
HRZZ-IP-2013-11-1637 - Kodovi i s njima povezane kombinatoričke strukture (CoCoS) (Crnković, Dean, HRZZ - 2013-11) ( CroRIS)
Ustanove:
Sveučilište u Rijeci, Fakultet za matematiku
Profili:
Marija Maksimović
(autor)
Citiraj ovu publikaciju:
Č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