Abstract
We establish several infinite classes of regular graphs with the property that any two distinct vertices have a fixed number of other vertices joined to both of them. The graphs are found by constructing their incidence matrices, which correspond to certain Hadamard matrices.
Publisher
Cambridge University Press (CUP)
Reference3 articles.
1. Two new block designs;Wallis;J. Combinatorial Theory
2. On a combinatorial generalization of twenty-seven lines associated with a cubic surface;Ahrens;J. Austral. Math. Soc.
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Transposable and symmetrizable matrices;Journal of the Australian Mathematical Society;1980-06
2. Ramsey graphs and block designs;Journal of Combinatorial Theory, Series A;1976-01
3. The Hamiltonian product of graphs;Lecture Notes in Mathematics;1974
4. On a problem of K. A. Bush concerning Hadamard matrices;Bulletin of the Australian Mathematical Society;1972-06
5. Construction of strongly regular graphs using affine designs;Bulletin of the Australian Mathematical Society;1971-02