Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes (Q2168927): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / OpenAlex ID
 
Property / OpenAlex ID: W4226111915 / rank
 
Normal rank

Revision as of 19:59, 19 March 2024

scientific article
Language Label Description Also known as
English
Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes
scientific article

    Statements

    Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes (English)
    0 references
    0 references
    0 references
    0 references
    26 August 2022
    0 references
    A weighing matrix \(W\) is quasi-balanced if \(|W|\,|W|^\top = |W|^\top\,|W|\) has at most two off-diagonal entries, where \(|W|_{ij} = |W_{ij}|\). A quasi-balanced weighing matrix \(W\) signs a strongly regular graph if \(|W|\) coincides with its adjacency matrix. Among other results, in this work, some signed strongly regular graphs and their equivalent association schemes are presented.
    0 references
    weighing matrix
    0 references
    strongly regular graph
    0 references
    divisible design graph
    0 references
    association scheme
    0 references

    Identifiers