New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs (Q2166298): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph switching, 2-ranks, and graphical Hadamard matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Properties of Group Divisible Incomplete Block Designs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the \(p\)-rank of the adjacency matrices of strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Walk-regular divisible design graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: New constructions of divisible design Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3150731 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deza graphs based on symplectic spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3866128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Divisible design graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Switching for Small Strongly Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On divisible design Cayley graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Wallis--Fon-Der-Flaass construction of strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spectra of Deza graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of strongly regular graphs using affine designs / rank
 
Normal rank

Latest revision as of 22:27, 29 July 2024

scientific article
Language Label Description Also known as
English
New versions of the Wallis-Fon-Der-Flaass construction to create divisible design graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references