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

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7576660
Language Label Description Also known as
default for all languages
No label defined
    English
    Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes
    scientific article; zbMATH DE number 7576660

      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