Abstract
K.A. Bush has asked whether there is a symmetric Hadamard matrix of order m2, m even, which can be partitioned into an m × m array of m × m blocks, such that:(i) each diagonal block has every entry 1;(ii) each non-diagonal block has every row-sum zero?We give two ways of constructing such matrices.
Publisher
Cambridge University Press (CUP)
Reference10 articles.
1. Construction of strongly regular graphs using affine designs: Corrigenda
2. Special Hadamard matrices;Wallis;Notices Amer. Math. Soc.,1972
3. Graphs in which each pair of vertices is adjacent to the same number d of other vertices;Bose;Studia Sci. Math. Hungar.,1970
4. Finite nets. II. Uniqueness and imbedding
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献