Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes (Q2168927): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 00:35, 2 February 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
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