Construction of strongly regular graphs using affine designs
Author:
- 1 February 1971
- journal article
- research article
- Published by Cambridge University Press (CUP) in Bulletin of the Australian Mathematical Society
- Vol. 4 (1) , 41-49
Abstract
Suppose there exist a balanced incomplete block design with λ = 1 and an affine resolvable balanced incomplete block design, the two designs having the same replication number. Combining these designs we construct two strongly regular graphs. This is applied to give a new family of design graphs ((v, k, λ)-graphs). Finally, we show that for any prime power n there are two non-isomorphic design graphs with v = n2(n+2), k = n(n+1) and λ = n.Keywords
This publication has 7 references indexed in Scilit:
- A note on quasi-symmetric designsJournal of Combinatorial Theory, 1970
- Strongly Regular Graphs Derived from Combinatorial DesignsCanadian Journal of Mathematics, 1970
- On a combinatorial generalization of 27 lines associated with a cubic surfaceJournal of the Australian Mathematical Society, 1969
- GRAPH THEORY1969
- Certain graphs arising from Hadamard matricesBulletin of the Australian Mathematical Society, 1969
- Finite Geometries1968
- Strongly regular graphs, partial geometries and partially balanced designsPacific Journal of Mathematics, 1963