Access Statistics for Edwin Robert van Dam

Author contact details at EconPapers.

Working Paper File Downloads Abstract Views
Last month 3 months 12 months Total Last month 3 months 12 months Total
A Characterization of Distance-Regular Graphs with Diameter Three 0 0 4 67 2 3 17 313
A Lower Bound for the Spectral Radius of Graphs with Fixed Diameter 0 1 5 5 1 7 19 19
A new family of distance-regular graphs with unbounded diameter 0 0 2 18 2 2 7 79
Asymptotic Results on the Spectral Radius and the Diameter of Graphs 0 1 5 5 0 2 9 9
Bounds for Maximin Latin Hypercube Designs 1 2 7 24 5 9 31 128
Bounds on Separated Pairs of Subgraphs, Eigenvalues and Related Polynomials 0 0 1 19 1 1 9 130
Characterizing distance-regularity of graphs by the spectrum 1 1 3 29 1 2 12 119
Codes, graphs, and schemes from nonlinear functions 0 2 10 120 6 21 114 669
Combinatorial designs with two singular values I. uniform multiplicative designs 0 0 1 16 3 5 17 94
Combinatorial designs with two singular values II. partial geometric designs 0 0 1 15 0 0 9 128
Coordination of coupled black box simulations in the contstruction of metamodels 1 1 3 30 2 3 6 139
Cospectral graphs and the generalized adjacency matrix 0 0 12 58 1 5 73 279
Developments on Spectral Characterizations of Graphs 1 1 9 22 1 1 16 54
Eigenvalues and the Diameter of Graphs 0 0 0 0 1 5 24 212
Equitable resolvable coverings 0 0 1 10 0 0 4 61
Fissioned triangular schemes via the cross-ratio 0 0 1 21 1 2 13 228
Graphs with Constant u and u 0 0 3 24 9 19 59 373
Graphs with Given Diameter Maximizing the Spectral Radius (Revision of CentER Discussion Paper 2006-105) 0 0 1 12 0 1 15 76
Maximin Latin hypercube designs in two dimensions 1 3 11 100 3 15 69 498
Nested Maximin Latin Hypercube Designs 3 5 13 13 6 11 39 39
Nested maximin Latin hypercube designs in two dimensions 0 2 5 48 0 3 14 189
Nonregular graphs with three eigenvalues 1 1 2 34 5 7 13 184
One-dimensional nested maximin designs 0 2 7 26 1 5 20 140
Regular Graphs with Four Eigenvalues 2 2 13 58 5 11 35 406
Small regular graphs with four eigenvalues 2 2 7 58 7 8 28 394
Some Implications on Amorphic Association Schemes 0 0 2 4 1 2 11 19
Space-Filling Latin Hypercube Designs For Computer Experiments (Revision of CentER DP 2006-18) 2 5 31 31 5 23 88 88
Space-filling Latin hypercube designs for computer experiments 0 0 4 207 31 65 215 968
Spectral Characterization of the Hamming Graphs 0 0 5 16 2 6 36 86
Spectral characterizations of some distance-regular graphs 0 0 4 75 5 9 25 382
Strongly regular decompositions of the complete graph 0 0 6 24 1 4 20 95
The minimal spectral radius of graphs with a given diameter 0 1 7 38 3 14 39 229
Three-class association schemes 0 0 5 54 3 4 15 245
Two-dimensional minimax Latin hypercube designs 0 0 3 32 0 0 14 161
Which graphs are determined by their spectrum? 3 7 33 165 11 23 61 353
Total Working Papers 18 39 227 1,478 125 298 1,196 7,586


Statistics updated 2009-12-07