Abstract
We show that three pairwise 4-regular graphs constructed by the second author are members of infinite families.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
A. E. Brouwer, Some new two-weight codes and strongly regular graphs.Discrete Appl. Math.,10 (1985) 111–114. MR 86d:05023; Zbl 561.94008.
A. E. Brouwer andJ. H. van Lint, Strongly regular graphs and partial geometries, pp. 85–122 in:Enumeration and Design-Proc. Silver Jubilee Conf. on Combinatorics, Waterloo,1982 (D. M. Jackson & S. A. Vanstone, eds.), Academic Press, Toronto,1984, MR 87c:05033; Zbl 555.05016.
A. R. Calderbank andW. M. Kantor, The geometry of two-weight codes,Bull. London Math. Soc.,18 (1986) 97–122.
Ph.Delsarte, Weights of linear codes and strongly regular normed spaces,Discrete Math.,3 (1972) 47–64.
W. H. Haemers,Eigenvalue techniques in design and graph theory, Reidel, Dordrecht (1980). Thesis (T. H. Eindhoven, 1979)=Math. Centr. Tract 121 (Amsterdam, 1980).
M. D. Hestenes andD. G. Higman, Rank 3 groups and strongly regular graphs, pp. 141–159 in:Computers in Algebra and Number Theory, Symp. New York 1970, SIAM-AMS Proc., vol. IV (G. Birkhoff & M. Hall, jr., eds.). AMS, Providence,1971.
W. M. Kantor, Exponential numbers of two-weight codes, difference sets, and symmetric designs,Discrete Math.,46 (1983) 95–98.