Comparison of two techniques for proving nonexistence of strongly regular graphs (Q659689): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polarities in finite projective planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly regular graphs, partial geometries and partially balanced designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3218138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4661935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems for Partially Balanced Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Friendship Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Moore Graphs with Diameters 2 and 3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5654053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5632577 / rank
 
Normal rank

Latest revision as of 21:22, 4 July 2024

scientific article
Language Label Description Also known as
English
Comparison of two techniques for proving nonexistence of strongly regular graphs
scientific article

    Statements

    Comparison of two techniques for proving nonexistence of strongly regular graphs (English)
    0 references
    0 references
    24 January 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    Strongly regular graphs
    0 references
    Friendship theorem
    0 references
    counting closed walks
    0 references
    counting eigenvalue multiplicities
    0 references
    0 references
    0 references