Construction of strongly regular graphs using affine

0 downloads 0 Views 26KB Size Report
W.D. Wallis. There is a ... equation (7) must be changed to. (7) k = n and the ... [7] W.D. Wallis, "Construction of strongly regular'graphs using affine designs", Bull.
BULL. AUSTRAL. MATH. SOC.

MOS 05B05, 05C99

VOL. 5 (1971), 431.

(O5B25, 62KI0)

Construction of strongly regular graphs using affine designs: Corrigenda W.D. Wallis There is a numerical error in the statement of Theorem 1 of [/].

The

expression (u-fc)u + (k-2)n which occurs in (6) must be replaced by (v-k)\i + (fc-2)nu , and a similar change must be made in line 5 of page !*6. As a consequence, equation (7) must be changed to (7)

k = n

and the definition of

x

to

x = (v-n)v in the statement of Theorem 2.

These changes are purely arithmetical, and

do not entail any further changes in the paper.

Reference [7]

W.D. Wallis, "Construction of strongly regular'graphs using affine designs", Bull. Austral. Math. Soc. 4 (1971), U1-U9.

University of Newcastle, Newcastle, New South Wales. Received 21 June 1971. The author is most grateful to Professor S.S. Shrikhande, who pointed out the error to him. 431