On a class of symmetric balanced generalized weighing matrices
From MaRDI portal
Publication:1412243
The paper describes a recursive construction of symmetric generalized balanced weighing matrices with zero diagonal, and a construction of strongly regular graphs from such matrices. As an application, two new infinite classes of strongly regular graphs are found that generalize previous work by Janko and Kharaghani.
Recommendations
Cited in
(10)- A technique for constructing symmetric designs
- Doubly regular digraphs and symmetric designs
- Weighted matrix means and symmetrization procedures
- Quasi-balanced weighing matrices, signed strongly regular graphs and association schemes
- Divisible design graphs
- A family of balanced generalized weighing matrices
- Balanced generalized weighing matrices and their applications
- New families of strongly regular graphs
- Some regular signed graphs with only two distinct eigenvalues
- A difference matrix construction and a class of balanced generalized weighing matrices
This page was built for publication: On a class of symmetric balanced generalized weighing matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1412243)