Graph switching, 2-ranks, and graphical Hadamard matrices (Q2317657): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
Created claim: Wikidata QID (P12): Q128713413, #quickstatements; #temporary_batch_1730404169347
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Switched symplectic graphs and their 2-ranks / 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: Spectra of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly regular graphs with maximal energy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Binary codes of strongly regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A switching for all strongly regular collinearity graphs from polar spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly regular graphs defined by spreads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of strongly regular graphs having minimal \(p\)-rank / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128713413 / rank
 
Normal rank

Latest revision as of 20:50, 31 October 2024

scientific article
Language Label Description Also known as
English
Graph switching, 2-ranks, and graphical Hadamard matrices
scientific article

    Statements

    Graph switching, 2-ranks, and graphical Hadamard matrices (English)
    0 references
    0 references
    0 references
    0 references
    12 August 2019
    0 references
    strongly regular graph
    0 references
    Seidel switching
    0 references
    Godsil-Mckay switching
    0 references
    2-rank
    0 references
    Hadamard matrix
    0 references

    Identifiers