-
1
-
-
0002309888
-
Orthogonal partitions in designed experiments
-
R.A. Bailey, "Orthogonal partitions in designed experiments," Des. Codes Cryptogr. 8 (1996), 45-77.
-
(1996)
Des. Codes Cryptogr
, vol.8
, pp. 45-77
-
-
Bailey, R.A.1
-
2
-
-
84867976073
-
A root graph that is locally the line graph of the Petersen graph
-
A.E. Brouwer, J.H. Koolen, and M.H. Klin, "A root graph that is locally the line graph of the Petersen graph," Disc. Math. 264 (2003), 13-24.
-
(2003)
Disc. Math
, vol.264
, pp. 13-24
-
-
Brouwer, A.E.1
Koolen, J.H.2
Klin, M.H.3
-
3
-
-
0442287675
-
Distance regular graphs of diameter 3 and strongly regular graphs
-
A. E. Brouwer, "Distance regular graphs of diameter 3 and strongly regular graphs," Disc. Math. 49 (1984), 101-103.
-
(1984)
Disc. Math
, vol.49
, pp. 101-103
-
-
Brouwer, A.E.1
-
4
-
-
0001913243
-
Strongly regular graphs and partial geometries
-
eds, D.M. Jackson and S.A. Vanstone, Academic Press
-
A.E. Brouwer and J.H. van Lint, "Strongly regular graphs and partial geometries," in: Enumeration and Designs, (eds.) D.M. Jackson and S.A. Vanstone, Academic Press, 1984, pp. 85-122.
-
(1984)
Enumeration and Designs
, pp. 85-122
-
-
Brouwer, A.E.1
van Lint, J.H.2
-
6
-
-
0344526856
-
A prolific construction of strongly regular graphs with the n-e.c. property
-
R31
-
P. Cameron and D. Stark, "A prolific construction of strongly regular graphs with the n-e.c. property," Elec J. Combin. 9 (2002), #R31.
-
(2002)
Elec J. Combin
, vol.9
-
-
Cameron, P.1
Stark, D.2
-
7
-
-
0346977547
-
Primitive rank 3 groups on symmetric designs
-
U. Dempwolff, "Primitive rank 3 groups on symmetric designs," Des. Codes Cryptogr. 22 (2001), 191-207.
-
(2001)
Des. Codes Cryptogr
, vol.22
, pp. 191-207
-
-
Dempwolff, U.1
-
8
-
-
0344526854
-
New prolific constructions of strongly regular graphs
-
D.G. Fon-Der-Flaass, "New prolific constructions of strongly regular graphs," Adv. Geom. 2(3) (2002), 301-306.
-
(2002)
Adv. Geom
, vol.2
, Issue.3
, pp. 301-306
-
-
Fon-Der-Flaass, D.G.1
-
9
-
-
0000322616
-
Strongly regular graphs
-
X.L.Hubaut, "Strongly regular graphs," Discrete Math. 13 (1975), 357-381.
-
(1975)
Discrete Math
, vol.1
, Issue.3
, pp. 357-381
-
-
Hubaut, X.L.1
-
11
-
-
0041011039
-
Strongly regular graphs derived from combinatorial designs
-
J.M. Goethels and J.J. Seidel, "Strongly regular graphs derived from combinatorial designs," Canad. J. Math. 22 (1970), 597-619.
-
(1970)
Canad. J. Math
, vol.22
, pp. 597-619
-
-
Goethels, J.M.1
Seidel, J.J.2
-
12
-
-
33847250760
-
Strongly regular graph on 96 vertices
-
M. Klin, "Strongly regular graph on 96 vertices," J. Geom. 65 (1999), 15-16.
-
(1999)
J. Geom
, vol.65
, pp. 15-16
-
-
Klin, M.1
-
13
-
-
0000314820
-
Solution of Kirkman's school-girl problem
-
AMS, Providence R.I
-
D.K. Ray-Chaudhuri and R.M. Wilson, "Solution of Kirkman's school-girl problem," Proc. Symp. Pure Math. 19, AMS, Providence R.I. (1971), 187-203.
-
(1971)
Proc. Symp. Pure Math
, vol.19
, pp. 187-203
-
-
Ray-Chaudhuri, D.K.1
Wilson, R.M.2
-
14
-
-
84959643723
-
Construction of strongly regular graphs using affine designs
-
W.D. Wallis, "Construction of strongly regular graphs using affine designs," Bull. Ausnal. Math. Soc. 4 (1971), 41-49.
-
(1971)
Bull. Ausnal. Math. Soc
, vol.4
, pp. 41-49
-
-
Wallis, W.D.1
|