论文信息 - Strongly regular graphs with smallest eigenvalue —m - 字舞流文

Strongly regular graphs with smallest eigenvalue —m

[1] J. Seidel. Strongly regular graphs with (-1, 1, 0) adjacency matrix having eigenvalue 3 , 1968 .

[2] R. C. Bose. Strongly regular graphs, partial geometries and partially balanced designs. , 1963 .

[3] R. H. Bruck. Finite nets. II. Uniqueness and imbedding. , 1963 .

[4] S. S. Shrikhande,et al. The Uniqueness of the $\mathrm{L}_2$ Association Scheme , 1959 .

[5] Surveys in Combinatorics: Strongly regular graphs , 1979 .

[6] R. Wilson. An Existence Theory for Pairwise Balanced Designs, III: Proof of the Existence Conjectures , 1975, J. Comb. Theory, Ser. A.

[7] Haim Hanani,et al. Balanced incomplete block designs and related designs , 1975, Discret. Math..

[8] Xavier L. Hubaut. Strongly regular graphs , 1975, Discret. Math..

[9] Richard M. Wilson,et al. An Existence Theory for Pairwise Balanced Designs II. The Structure of PBD-Closed Sets and the Existence Conjectures , 1972, J. Comb. Theory A.

[10] Paul Erdös,et al. On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order , 1960, Canadian Journal of Mathematics.