Working Paper |
File Downloads |
Abstract Views |

Last month |
3 months |
12 months |
Total |
Last month |
3 months |
12 months |
Total |

A Cauchy-Khinchin matrix inequality |
0 |
0 |
1 |
1 |
0 |
1 |
3 |
10 |

A Lower Bound for the Spectral Radius of Graphs with Fixed Diameter |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
10 |

A New Family of Distance-Regular Graphs with Unbounded Diameter |
0 |
0 |
0 |
2 |
0 |
0 |
4 |
15 |

A characterization of association schemes from affine spaces |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
6 |

A characterization of distance-regular graphs with diameter three |
0 |
0 |
0 |
1 |
0 |
0 |
2 |
14 |

A characterization of distance-regular graphs with diameter three |
0 |
0 |
0 |
3 |
0 |
0 |
2 |
23 |

A lower bound for the spectral radius of graphs with fixed diameter |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
6 |

A new family of distance-regular graphs with unbounded diameter |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
8 |

A nonregular analogue of conference graphs |
0 |
0 |
0 |
1 |
0 |
0 |
2 |
9 |

A short proof of the odd-girth theorem |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
11 |

An Odd Characterization of the Generalized Odd Graphs |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
14 |

An odd characterization of the generalized odd graphs |
0 |
0 |
0 |
0 |
0 |
0 |
4 |
93 |

Association schemes related to Kasami codes and Kerdock sets |
0 |
0 |
0 |
2 |
0 |
0 |
4 |
9 |

Asymptotic Results on the Spectral Radius and the Diameter of Graphs |
0 |
0 |
0 |
0 |
0 |
1 |
3 |
8 |

Asymptotic results on the spectral radius and the diameter of graphs |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |

Bounds for Maximin Latin Hypercube Designs |
0 |
0 |
0 |
5 |
0 |
0 |
4 |
25 |

Bounds for maximin Latin hypercube designs |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
6 |

Bounds on separated pairs of subgraphs, eigenvalues and related polynomials |
0 |
0 |
0 |
2 |
0 |
0 |
1 |
15 |

Bounds on special subsets in graphs, eigenvalues and association schemes |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
4 |

Characterizing Distance-Regularity of Graphs by the Spectrum |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
8 |

Characterizing distance regularity of graphs by the spectrum |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
5 |

Classification of spreads of PG(3,4)\PG(3,2) |
0 |
0 |
0 |
3 |
1 |
1 |
2 |
19 |

Codes, Graphs and Schemes from Nonlinear Functions |
0 |
0 |
0 |
2 |
0 |
0 |
1 |
11 |

Codes, graphs and schemes from nonlinear functions |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
7 |

Collaborative metamodelling: Coordinating simulation-based product design |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
5 |

Combinatorial Designs with Two Singular Values I. Uniform Multiplicative Designs |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
8 |

Combinatorial Designs with Two Singular Values II. Partial Geometric Designs |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
11 |

Combinatorial designs with two singular values - I. Uniform multiplicative designs |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
15 |

Combinatorial designs with two singular values II. Partial geometric designs |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
7 |

Coordination of Coupled Black Box Simulations in the Construction of Metamodels |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
23 |

Cospectral Graphs and the Generalized Adjacency Matrix |
0 |
0 |
1 |
2 |
0 |
0 |
6 |
26 |

Cospectral graphs and the generalized adjacency matrix |
0 |
0 |
0 |
2 |
0 |
0 |
1 |
9 |

Developments on Spectral Characterizations of Graphs |
0 |
0 |
0 |
5 |
0 |
0 |
2 |
15 |

Developments on spectral characterizations of graphs |
0 |
0 |
0 |
1 |
0 |
0 |
2 |
8 |

Distance-regular Cayley graphs with least eigenvalue -2 |
0 |
1 |
1 |
1 |
0 |
1 |
4 |
21 |

Distance-regular graphs |
0 |
0 |
0 |
1 |
0 |
0 |
2 |
9 |

Dual concepts of almost distance-regularity and the spectral excess theorem |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |

Eigenvalues and the Diameter of Graphs |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
255 |

Eigenvalues and the diameter of graphs |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
4 |

Eigenvalues and the diameter of graphs |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
7 |

Enhancement of Sandwich Algorithms for Approximating Higher Dimensional Convex Pareto Sets |
0 |
0 |
0 |
5 |
0 |
2 |
5 |
32 |

Enriching the Tactical Network Design of Express Service Carriers with Fleet Scheduling Characteristics |
0 |
0 |
0 |
2 |
0 |
0 |
6 |
55 |

Enriching the tactical network design of express service carriers with fleet scheduling characteristics |
0 |
0 |
1 |
4 |
0 |
0 |
1 |
38 |

Equitable Resolvable Coverings |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |

Equitable resolvable coverings |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
6 |

Fissioned Triangular Schemes Via the Cross-Ratio |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
23 |

Fissioned triangular schemes with the cross-ratio |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
24 |

Fissions of classical self-dual association schemes |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
2 |

Geometric aspects of 2-walk-regular graphs |
0 |
0 |
0 |
2 |
0 |
0 |
1 |
15 |

Graphs whose normalized laplacian has three eigenvalues |
0 |
0 |
0 |
10 |
0 |
0 |
1 |
23 |

Graphs with constant mu and mu-bar |
0 |
0 |
0 |
1 |
0 |
1 |
2 |
13 |

Graphs with constant μ and μ |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
7 |

Graphs with few eigenvalues. An interplay between combinatorics and algebra |
0 |
0 |
7 |
46 |
0 |
2 |
14 |
129 |

Graphs with given diameter maximizing the spectral radius |
0 |
0 |
0 |
4 |
0 |
0 |
0 |
11 |

Graphs, distances and eigenvalues |
0 |
0 |
0 |
0 |
0 |
1 |
4 |
11 |

Maximin Latin Hypercube Designs in Two Dimensions |
0 |
0 |
0 |
5 |
0 |
0 |
1 |
31 |

Maximin Latin hypercube designs in two dimensions |
0 |
0 |
1 |
6 |
0 |
0 |
2 |
15 |

Nested Maximin Latin Hypercube Designs |
0 |
0 |
0 |
2 |
0 |
0 |
2 |
23 |

Nested Maximin Latin Hypercube Designs in Two Dimensions |
0 |
0 |
0 |
4 |
0 |
0 |
3 |
17 |

Nested maximin Latin hypercube designs |
0 |
0 |
0 |
2 |
0 |
0 |
4 |
18 |

Nonregular Graphs with Three Eigenvalues |
0 |
0 |
0 |
1 |
0 |
1 |
4 |
17 |

Nonregular graphs with three eigenvalues |
0 |
0 |
0 |
2 |
0 |
0 |
2 |
11 |

On Almost Distance-Regular Graphs |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
14 |

On bounding the bandwidth of graphs with symmetry |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
13 |

On perturbations of almost distance-regular graphs |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
7 |

One-Dimensional Nested Maximin Designs |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
9 |

One-dimensional nested maximin designs |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
4 |

Pancakes and crooked graphs |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
10 |

Regular graphs with four eigenvalues |
0 |
0 |
0 |
4 |
1 |
1 |
1 |
16 |

Regular graphs with four eigenvalues |
0 |
0 |
0 |
2 |
0 |
0 |
0 |
15 |

Regular graphs with maximal energy per vertex |
0 |
0 |
0 |
4 |
0 |
0 |
3 |
14 |

Robustness of networks against viruses: The role of the spectral raduis |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
5 |

Small Regular Graphs with Four Eigenvalues |
0 |
0 |
0 |
4 |
0 |
0 |
3 |
21 |

Small regular graphs with four eigenvalues |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
6 |

Some Implications on Amorphic Association Schemes |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
14 |

Some implications on amorphic association schemes |
0 |
0 |
0 |
0 |
0 |
1 |
1 |
8 |

Space-Filling Latin Hypercube Designs For Computer Experiments (Revision of CentER DP 2006-18) |
0 |
0 |
0 |
10 |
0 |
0 |
1 |
30 |

Space-filling Latin hypercube designs for computer experiments |
0 |
0 |
0 |
3 |
0 |
0 |
5 |
37 |

Spectral Characterization of the Hamming Graphs |
0 |
0 |
0 |
0 |
1 |
2 |
4 |
20 |

Spectral Characterizations of Some Distance-Regular Graphs |
0 |
0 |
0 |
2 |
0 |
0 |
2 |
18 |

Spectral characterizations of some distance-regular graphs |
0 |
0 |
0 |
2 |
0 |
0 |
1 |
9 |

Spectral characterizations of the Hamming graph |
0 |
0 |
0 |
3 |
0 |
0 |
0 |
7 |

Strongly Regular Decompositions of the Complete Graph |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
3 |

Strongly regular decompositions of the complete graph |
0 |
0 |
0 |
0 |
0 |
0 |
0 |
5 |

Strongly walk-regular grapsh |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
11 |

The Laplacian spectral excess theorem for distance-regular graphs |
0 |
0 |
0 |
3 |
0 |
0 |
0 |
19 |

The Minimal Spectral Radius of Graphs with a Given Diameter |
0 |
0 |
0 |
2 |
1 |
2 |
2 |
9 |

The combinatorics of Dom de Caen |
0 |
0 |
0 |
1 |
0 |
0 |
2 |
8 |

The minimal spectral radius of graphs with a given diameter |
0 |
0 |
0 |
0 |
0 |
0 |
3 |
8 |

The spectral excess theorem for distance-regular graphs: A global (over)view |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
9 |

Three-Class Association Schemes |
0 |
0 |
0 |
1 |
0 |
2 |
4 |
18 |

Three-class association schemes |
0 |
0 |
0 |
2 |
0 |
0 |
1 |
8 |

Two-Dimensional Minimax Latin Hypercube Designs |
0 |
0 |
0 |
0 |
0 |
1 |
2 |
12 |

Two-dimensional maximin Latin hypercube designs |
0 |
0 |
0 |
0 |
1 |
1 |
1 |
7 |

Uniformity in Association schemes and Coherent Configurations: Cometric Q-Antipodal Schemes and Linked Systems |
0 |
0 |
0 |
1 |
0 |
0 |
1 |
6 |

Uniformity in association schemes and coherent configurations: Cometric Q-antipodal schemes and linked systems |
0 |
0 |
0 |
3 |
0 |
0 |
0 |
17 |

Uniformly packed codes and more distance regular graphs from crooked functions |
0 |
0 |
0 |
0 |
0 |
0 |
7 |
11 |

Which Graphs are Determined by their Spectrum? |
0 |
0 |
0 |
4 |
1 |
1 |
1 |
17 |

Which graphs are determined by their spectrum? |
0 |
0 |
0 |
12 |
0 |
0 |
3 |
44 |

[Review of the book Handbook of Coding Theory I, II, V.S. Pless & W.C. Huffman, 2001] |
0 |
0 |
2 |
14 |
0 |
0 |
5 |
34 |

Total Working Papers |
0 |
1 |
14 |
220 |
7 |
24 |
178 |
1,815 |