Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group (Q2333615): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.3390/sym10060212 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: GRAPE / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3390/sym10060212 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2805198538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718791 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040243 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly regular graphs with non-trivial automorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of strongly regular graphs having an automorphism group of composite order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of block designs admitting an abelian automorphism group / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of all symmetric block designs of order nine with an automorphism of order six / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new symmetric designs with parameters (64, 28, 12) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-orthogonal codes from the strongly regular graphs on up to 40 vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On symmetric block designs (40,13,4) with automorphisms of order 5 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance regular graphs of diameter 3 and strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On triple systems and strongly regular graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129707059 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.3390/SYM10060212 / rank
 
Normal rank

Latest revision as of 01:35, 18 December 2024

scientific article
Language Label Description Also known as
English
Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group
scientific article

    Statements

    Enumeration of strongly regular graphs on up to 50 vertices having \(S_{3}\) as an automorphism group (English)
    0 references
    0 references
    0 references
    13 November 2019
    0 references
    Summary: 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 \(S_3\) as an automorphism group. The construction of SRGs in this paper is a step in the classification of SRGs on up to 50 vertices.
    0 references
    strongly regular graph
    0 references
    automorphism group
    0 references
    orbit matrix
    0 references

    Identifiers