Search the dblp DataBase

Publications of Author

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