Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes
From MaRDI portal
Publication:2168927
Abstract: A weighing matrix is quasi-balanced if has at most two off-diagonal entries, where . A quasi-balanced weighing matrix signs a strongly regular graph if coincides with its adjacency matrix. Among other things, signed strongly regular graphs and their equivalent association schemes are presented.
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.
Recommendations
Cites work
- Algebraic design theory
- Balanced generalized weighing matrices and their applications
- Balanced weighing matrices
- Combinatorics of symmetric designs
- Cyclic relative difference sets with classical parameters
- scientific article; zbMATH DE number 4014744 (Why is no real title available?)
- scientific article; zbMATH DE number 3884178 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 50655 (Why is no real title available?)
- scientific article; zbMATH DE number 193433 (Why is no real title available?)
- scientific article; zbMATH DE number 3512125 (Why is no real title available?)
- scientific article; zbMATH DE number 7008242 (Why is no real title available?)
- scientific article; zbMATH DE number 1382770 (Why is no real title available?)
- scientific article; zbMATH DE number 3995696 (Why is no real title available?)
- scientific article; zbMATH DE number 786138 (Why is no real title available?)
- Multiplicative number theory. I. Classical theory
- On a decomposition of complete graphs
- On vanishing sums of roots of unity.
- Perfect codes and balanced generalized weighing matrices. II
- Perfect codes and balanced generalized weighing matrices. II
- Siamese objects, and their relation to color graphs, association schemes and Steiner designs
- Strongly regular graphs
This page was built for publication: Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2168927)