The strongly regular (45,\,12,\,3,\,3) graphs (Q2500951): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import IPFS CIDs
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Kris Coolsaet / rank
Normal rank
 
Property / author
 
Property / author: Spence, Edward / rank
Normal rank
 
Property / author
 
Property / author: Kris Coolsaet / rank
 
Normal rank
Property / author
 
Property / author: Spence, Edward / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / IPFS content identifier
 
Property / IPFS content identifier: bafkreigvpxyqyoidydzdlhrgmf653vrnnrbwxwemvugxuy46s7iqwojg6i / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:32, 22 February 2025

scientific article
Language Label Description Also known as
English
The strongly regular (45,\,12,\,3,\,3) graphs
scientific article

    Statements

    The strongly regular (45,\,12,\,3,\,3) graphs (English)
    0 references
    0 references
    0 references
    0 references
    30 August 2006
    0 references
    Summary: Using two backtrack algorithms based on different techniques, designed and implemented independently, we were able to determine up to isomorphism all strongly regular graphs with parameters \(v=45\), \(k=12\), \(\lambda=\mu=3\). It turns out that there are \(78\) such graphs, having automorphism groups with sizes ranging from \(1\) to \(51840\).
    0 references
    backtrack algorithms
    0 references
    automorphism groups
    0 references

    Identifiers