| 2006 |
|---|
| 21 | EE | Kris Coolsaet,
Jan Degraer,
Edward Spence:
The Strongly Regular (45, 12, 3, 3) Graphs.
Electr. J. Comb. 13(1): (2006) |
| 20 | EE | Edwin R. van Dam,
Willem H. Haemers,
Jacobus H. Koolen,
Edward Spence:
Characterizing distance-regularity of graphs by the spectrum.
J. Comb. Theory, Ser. A 113(8): 1805-1820 (2006) |
| 2004 |
|---|
| 19 | EE | Willem H. Haemers,
Edward Spence:
Enumeration of cospectral graphs.
Eur. J. Comb. 25(2): 199-211 (2004) |
| 18 | EE | Edwin R. van Dam,
Edward Spence:
Combinatorial designs with two singular values--I: uniform multiplicative designs.
J. Comb. Theory, Ser. A 107(1): 127-142 (2004) |
| 2001 |
|---|
| 17 | EE | Willem H. Haemers,
Edward Spence:
The Pseudo-geometric Graphs for Generalized Quadrangles of Order (3, t).
Eur. J. Comb. 22(6): 839-845 (2001) |
| 2000 |
|---|
| 16 | | Frans C. Bussemaker,
Willem H. Haemers,
Edward Spence:
The Search for Pseudo Orthogonal Latin Squares of Order Six.
Des. Codes Cryptography 21(1/3): 77-82 (2000) |
| 15 | EE | Edward Spence:
The Strongly Regular (40, 12, 2, 4) Graphs.
Electr. J. Comb. 7: (2000) |
| 1999 |
|---|
| 14 | EE | Mario-Osvin Pavcevic,
Edward Spence:
Some new symmetric designs with lambda = 10 having an automorphism of order 5.
Discrete Mathematics 196(1-3): 257-266 (1999) |
| 13 | EE | Dominique de Caen,
Edwin R. van Dam,
Edward Spence:
A Nonregular Analogue of Conference Graphs.
J. Comb. Theory, Ser. A 88(1): 194-204 (1999) |
| 1998 |
|---|
| 12 | EE | Edwin R. van Dam,
Edward Spence:
Small regular graphs with four eigenvalues.
Discrete Mathematics 189(1-3): 233-257 (1998) |
| 1995 |
|---|
| 11 | EE | Edward Spence:
Classification of hadamard matrices of order 24 and 28.
Discrete Mathematics 140(1-3): 185-243 (1995) |
| 1994 |
|---|
| 10 | | Christopher Parker,
Edward Spence,
Vladimir D. Tonchev:
Designs with the Symmetric Difference Property on 64 Points and Their Groups.
J. Comb. Theory, Ser. A 67(1): 23-43 (1994) |
| 1993 |
|---|
| 9 | EE | Edward Spence:
A New Family of Symmetric 2-(v, k, lambda) Block Designs.
Eur. J. Comb. 14(2): 131-136 (1993) |
| 1992 |
|---|
| 8 | | Edward Spence:
A Complete Classification of Symmetric (31, 10, 3) Designs.
Des. Codes Cryptography 2(2): 127-136 (1992) |
| 7 | EE | Edward Spence:
Is Taylor's graph geometric?
Discrete Mathematics 106-107: 449-454 (1992) |
| 6 | EE | Edward Spence,
Vladimir D. Tonchev:
Extremal self-dual codes from symmetric designs.
Discrete Mathematics 110(1-3): 265-268 (1992) |
| 1989 |
|---|
| 5 | EE | Frans C. Bussemaker,
Willem H. Haemers,
J. J. Seidel,
Edward Spence:
On (v, k, lambda) graphs and designs with trivial automorphism group.
J. Comb. Theory, Ser. A 50(1): 33-46 (1989) |
| 1977 |
|---|
| 4 | | Edward Spence:
A Family of Difference Sets.
J. Comb. Theory, Ser. A 22(1): 103-106 (1977) |
| 1975 |
|---|
| 3 | | Michael J. Ganley,
Edward Spence:
Relative Difference Sets and Quasiregular Collineation Groups.
J. Comb. Theory, Ser. A 19(2): 134-153 (1975) |
| 2 | | Edward Spence:
Hadamard Matrices from Relative Difference Sets.
J. Comb. Theory, Ser. A 19(3): 287-300 (1975) |
| 1971 |
|---|
| 1 | | Edward Spence:
Some New Symmetric Block Designs.
J. Comb. Theory, Ser. A 11(3): 299-302 (1971) |
