论文信息 - A generalization of Wallis-Fon-Der-Flaass construction of strongly regular graphs - 字舞流文

A generalization of Wallis-Fon-Der-Flaass construction of strongly regular graphs

In this paper the Wallis-Fon-Der-Flaass construction of strongly regular graphs is generalized. As a result new prolific series of strongly regular graphs are obtained. Some of them have new parameters.

Mikhail Muzychuk

[1] W. D. Wallis,et al. Construction of strongly regular graphs using affine designs , 1971, Bulletin of the Australian Mathematical Society.

[2] Andries E. Brouwer,et al. Strongly regular graphs and partial geometries , 1984 .

[3] Peter J. Cameron,et al. A Prolific Construction of Strongly Regular Graphs with the n-e.c. Property , 2002, Electron. J. Comb..

[4] R. A. Bailey. Orthogonal partitions in designed experiments , 1996 .

[5] Xavier L. Hubaut,et al. Strongly regular graphs , 1975, Discret. Math..

[6] J. J. Seidel,et al. Strongly Regular Graphs Derived from Combinatorial Designs , 1970, Canadian Journal of Mathematics.

[7] Ulrich Dempwolff. Primitive Rank 3 Groups on Symmetric Designs , 2001, Des. Codes Cryptogr..

[8] Andries E. Brouwer. Distance regular graphs of diameter 3 and strongly regular graphs , 1984, Discret. Math..

[9] Vladimir D. Tonchev,et al. Spreads in strongly regular graphs , 1996 .

[10] Mikhail H. Klin,et al. A Root Graph that is Locally the Line Graph of the Peterson Graph , 2003, Discret. Math..

[11] W. Kantor,et al. New prolific constructions of strongly regular graphs , 2002 .