Classification of some strongly regular subgraphs of the McLaughlin graph (Q2468023): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2006.11.055 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001063486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992965 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computer-assisted proof of the uniqueness of the Perkel graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of three-class association schemes using backtracking with dynamic variable ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: The regular two-graph on 276 vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations / rank
 
Normal rank

Latest revision as of 16:08, 27 June 2024

scientific article
Language Label Description Also known as
English
Classification of some strongly regular subgraphs of the McLaughlin graph
scientific article

    Statements

    Classification of some strongly regular subgraphs of the McLaughlin graph (English)
    0 references
    0 references
    0 references
    30 January 2008
    0 references
    0 references
    computer classification
    0 references
    strongly regular graph
    0 references
    orderly generation
    0 references
    0 references