| 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 |
0 |
2 |
1 |
1 |
4 |
16 |
| A Lower Bound for the Spectral Radius of Graphs with Fixed Diameter |
0 |
0 |
0 |
0 |
0 |
1 |
10 |
24 |
| A New Family of Distance-Regular Graphs with Unbounded Diameter |
0 |
0 |
0 |
2 |
3 |
3 |
4 |
20 |
| A characterization of association schemes from affine spaces |
0 |
0 |
0 |
1 |
1 |
1 |
2 |
10 |
| A characterization of distance-regular graphs with diameter three |
0 |
0 |
0 |
4 |
2 |
3 |
4 |
22 |
| A characterization of distance-regular graphs with diameter three |
0 |
0 |
0 |
4 |
1 |
1 |
5 |
38 |
| A lower bound for the spectral radius of graphs with fixed diameter |
0 |
0 |
0 |
1 |
0 |
1 |
3 |
14 |
| A new family of distance-regular graphs with unbounded diameter |
0 |
0 |
0 |
0 |
5 |
5 |
9 |
20 |
| A nonregular analogue of conference graphs |
0 |
0 |
0 |
2 |
2 |
2 |
5 |
19 |
| A short proof of the odd-girth theorem |
0 |
0 |
0 |
0 |
1 |
1 |
3 |
16 |
| An Odd Characterization of the Generalized Odd Graphs |
0 |
0 |
0 |
0 |
1 |
2 |
3 |
26 |
| An odd characterization of the generalized odd graphs |
0 |
0 |
0 |
0 |
1 |
1 |
7 |
100 |
| Association schemes related to Kasami codes and Kerdock sets |
0 |
0 |
0 |
2 |
1 |
2 |
2 |
14 |
| Asymptotic Results on the Spectral Radius and the Diameter of Graphs |
0 |
0 |
0 |
0 |
1 |
1 |
5 |
14 |
| Asymptotic results on the spectral radius and the diameter of graphs |
0 |
0 |
0 |
0 |
1 |
2 |
6 |
14 |
| Bounds for Maximin Latin Hypercube Designs |
0 |
0 |
0 |
5 |
0 |
0 |
5 |
35 |
| Bounds for maximin Latin hypercube designs |
0 |
0 |
0 |
0 |
1 |
2 |
7 |
15 |
| Bounds on separated pairs of subgraphs, eigenvalues and related polynomials |
0 |
0 |
0 |
2 |
1 |
1 |
5 |
23 |
| Bounds on special subsets in graphs, eigenvalues and association schemes |
0 |
0 |
0 |
1 |
2 |
2 |
4 |
12 |
| Characterizing Distance-Regularity of Graphs by the Spectrum |
0 |
0 |
0 |
0 |
2 |
2 |
7 |
17 |
| Characterizing distance regularity of graphs by the spectrum |
0 |
0 |
0 |
1 |
4 |
4 |
8 |
14 |
| Classification of spreads of PG(3,4)\PG(3,2) |
0 |
0 |
0 |
3 |
2 |
2 |
6 |
29 |
| Codes, Graphs and Schemes from Nonlinear Functions |
0 |
0 |
0 |
2 |
1 |
1 |
3 |
17 |
| Codes, graphs and schemes from nonlinear functions |
0 |
0 |
0 |
1 |
3 |
3 |
3 |
11 |
| Collaborative metamodelling: Coordinating simulation-based product design |
0 |
0 |
0 |
1 |
3 |
3 |
4 |
11 |
| Combinatorial Designs with Two Singular Values I. Uniform Multiplicative Designs |
0 |
0 |
0 |
0 |
1 |
1 |
3 |
26 |
| Combinatorial Designs with Two Singular Values II. Partial Geometric Designs |
0 |
0 |
1 |
2 |
2 |
4 |
7 |
21 |
| Combinatorial designs with two singular values - I. Uniform multiplicative designs |
0 |
0 |
0 |
0 |
3 |
3 |
5 |
20 |
| Combinatorial designs with two singular values II. Partial geometric designs |
0 |
0 |
0 |
0 |
3 |
3 |
10 |
17 |
| Coordination of Coupled Black Box Simulations in the Construction of Metamodels |
0 |
0 |
0 |
2 |
1 |
1 |
4 |
29 |
| Cospectral Graphs and the Generalized Adjacency Matrix |
0 |
0 |
0 |
2 |
2 |
2 |
7 |
37 |
| Cospectral graphs and the generalized adjacency matrix |
0 |
0 |
0 |
2 |
0 |
0 |
1 |
10 |
| Developments on Spectral Characterizations of Graphs |
0 |
0 |
0 |
7 |
1 |
1 |
5 |
25 |
| Developments on spectral characterizations of graphs |
0 |
0 |
0 |
1 |
0 |
0 |
9 |
26 |
| Distance-regular Cayley graphs with least eigenvalue -2 |
0 |
0 |
0 |
3 |
5 |
5 |
5 |
32 |
| Distance-regular graphs |
0 |
0 |
0 |
2 |
0 |
0 |
1 |
19 |
| Dual concepts of almost distance-regularity and the spectral excess theorem |
0 |
0 |
0 |
0 |
1 |
1 |
4 |
8 |
| Eigenvalues and the Diameter of Graphs |
0 |
0 |
0 |
0 |
3 |
3 |
8 |
264 |
| Eigenvalues and the diameter of graphs |
0 |
0 |
0 |
2 |
1 |
1 |
4 |
11 |
| Eigenvalues and the diameter of graphs |
0 |
0 |
0 |
1 |
2 |
2 |
4 |
17 |
| Enhancement of Sandwich Algorithms for Approximating Higher Dimensional Convex Pareto Sets |
0 |
0 |
0 |
6 |
2 |
2 |
6 |
41 |
| Enriching the Tactical Network Design of Express Service Carriers with Fleet Scheduling Characteristics |
0 |
0 |
0 |
2 |
1 |
1 |
4 |
62 |
| Enriching the tactical network design of express service carriers with fleet scheduling characteristics |
0 |
0 |
0 |
4 |
0 |
1 |
6 |
47 |
| Equitable Resolvable Coverings |
0 |
0 |
0 |
0 |
2 |
2 |
3 |
9 |
| Equitable resolvable coverings |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
9 |
| Fissioned Triangular Schemes Via the Cross-Ratio |
0 |
0 |
0 |
0 |
1 |
1 |
3 |
27 |
| Fissioned triangular schemes with the cross-ratio |
0 |
0 |
0 |
0 |
0 |
1 |
4 |
29 |
| Fissions of classical self-dual association schemes |
0 |
0 |
0 |
1 |
3 |
3 |
7 |
12 |
| Geometric aspects of 2-walk-regular graphs |
0 |
0 |
0 |
2 |
3 |
3 |
9 |
25 |
| Graphs whose normalized laplacian has three eigenvalues |
0 |
0 |
0 |
10 |
1 |
1 |
3 |
28 |
| Graphs with Given Diameter Maximizing the Spectral Radius (Revision of CentER Discussion Paper 2006-105) |
0 |
0 |
0 |
0 |
2 |
2 |
5 |
12 |
| Graphs with constant mu and mu-bar |
0 |
0 |
0 |
1 |
1 |
1 |
12 |
33 |
| Graphs with constant μ and μ |
0 |
0 |
0 |
0 |
1 |
1 |
6 |
14 |
| Graphs with few eigenvalues: An interplay between combinatorics and algebra |
0 |
0 |
0 |
52 |
1 |
2 |
8 |
152 |
| Graphs with given diameter maximizing the spectral radius |
0 |
0 |
0 |
4 |
0 |
1 |
3 |
17 |
| Graphs, distances and eigenvalues |
0 |
0 |
0 |
0 |
2 |
2 |
4 |
15 |
| Maximin Latin Hypercube Designs in Two Dimensions |
0 |
0 |
0 |
5 |
2 |
3 |
11 |
46 |
| Maximin Latin hypercube designs in two dimensions |
0 |
0 |
0 |
6 |
3 |
3 |
9 |
25 |
| Nested Maximin Latin Hypercube Designs |
0 |
0 |
0 |
3 |
1 |
1 |
5 |
30 |
| Nested Maximin Latin Hypercube Designs in Two Dimensions |
0 |
0 |
0 |
4 |
3 |
4 |
9 |
27 |
| Nested maximin Latin hypercube designs |
0 |
0 |
0 |
2 |
1 |
2 |
2 |
23 |
| Nonregular Graphs with Three Eigenvalues |
0 |
0 |
0 |
2 |
1 |
1 |
5 |
33 |
| Nonregular graphs with three eigenvalues |
0 |
0 |
0 |
2 |
1 |
1 |
4 |
17 |
| On Almost Distance-Regular Graphs |
0 |
0 |
0 |
2 |
3 |
3 |
7 |
23 |
| On bounding the bandwidth of graphs with symmetry |
0 |
0 |
0 |
0 |
1 |
3 |
6 |
26 |
| On perturbations of almost distance-regular graphs |
0 |
0 |
0 |
2 |
2 |
3 |
4 |
12 |
| One-Dimensional Nested Maximin Designs |
0 |
0 |
0 |
1 |
1 |
1 |
6 |
22 |
| One-dimensional nested maximin designs |
0 |
0 |
0 |
0 |
2 |
2 |
7 |
14 |
| Pancakes and crooked graphs |
0 |
0 |
0 |
0 |
3 |
3 |
6 |
16 |
| Regular graphs with four eigenvalues |
0 |
0 |
0 |
4 |
5 |
5 |
10 |
32 |
| Regular graphs with four eigenvalues |
0 |
0 |
0 |
2 |
2 |
3 |
7 |
28 |
| Regular graphs with maximal energy per vertex |
0 |
0 |
0 |
4 |
2 |
2 |
4 |
19 |
| Robustness of networks against viruses: The role of the spectral raduis |
0 |
0 |
0 |
1 |
0 |
0 |
4 |
10 |
| Small Regular Graphs with Four Eigenvalues |
0 |
0 |
0 |
4 |
3 |
4 |
8 |
32 |
| Small regular graphs with four eigenvalues |
0 |
0 |
0 |
0 |
1 |
1 |
7 |
16 |
| Some Implications on Amorphic Association Schemes |
0 |
0 |
0 |
0 |
1 |
1 |
3 |
24 |
| Some implications on amorphic association schemes |
0 |
0 |
0 |
0 |
1 |
2 |
4 |
13 |
| Space-Filling Latin Hypercube Designs For Computer Experiments (Revision of CentER DP 2006-18) |
0 |
0 |
0 |
11 |
2 |
2 |
12 |
45 |
| Space-filling Latin hypercube designs for computer experiments |
0 |
0 |
0 |
3 |
2 |
3 |
5 |
46 |
| Spectral Characterization of the Hamming Graphs |
0 |
0 |
0 |
0 |
3 |
4 |
7 |
33 |
| Spectral Characterizations of Some Distance-Regular Graphs |
0 |
0 |
0 |
3 |
1 |
3 |
8 |
30 |
| Spectral characterizations of some distance-regular graphs |
0 |
0 |
0 |
2 |
1 |
1 |
5 |
19 |
| Spectral characterizations of the Hamming graph |
0 |
0 |
0 |
3 |
3 |
4 |
12 |
29 |
| Strongly Regular Decompositions of the Complete Graph |
0 |
0 |
0 |
0 |
1 |
2 |
5 |
13 |
| Strongly regular decompositions of the complete graph |
0 |
0 |
0 |
0 |
1 |
1 |
2 |
7 |
| Strongly walk-regular grapsh |
0 |
0 |
0 |
2 |
1 |
2 |
5 |
18 |
| The Laplacian spectral excess theorem for distance-regular graphs |
0 |
0 |
0 |
3 |
3 |
3 |
8 |
28 |
| The Minimal Spectral Radius of Graphs with a Given Diameter |
0 |
0 |
0 |
4 |
0 |
1 |
1 |
20 |
| The combinatorics of Dom de Caen |
0 |
0 |
0 |
1 |
1 |
1 |
5 |
14 |
| The minimal spectral radius of graphs with a given diameter |
0 |
0 |
0 |
0 |
0 |
1 |
4 |
14 |
| The spectral excess theorem for distance-regular graphs: A global (over)view |
0 |
0 |
0 |
1 |
0 |
0 |
3 |
14 |
| Three-Class Association Schemes |
0 |
0 |
0 |
3 |
3 |
3 |
12 |
44 |
| Three-class association schemes |
0 |
0 |
0 |
2 |
2 |
4 |
6 |
22 |
| Two-Dimensional Minimax Latin Hypercube Designs |
0 |
0 |
0 |
0 |
0 |
0 |
1 |
16 |
| Two-dimensional maximin Latin hypercube designs |
0 |
0 |
0 |
0 |
1 |
2 |
7 |
16 |
| Uniformity in Association schemes and Coherent Configurations: Cometric Q-Antipodal Schemes and Linked Systems |
0 |
0 |
0 |
1 |
0 |
0 |
0 |
10 |
| Uniformity in association schemes and coherent configurations: Cometric Q-antipodal schemes and linked systems |
0 |
0 |
0 |
3 |
1 |
1 |
3 |
25 |
| Uniformly packed codes and more distance regular graphs from crooked functions |
0 |
0 |
0 |
1 |
2 |
3 |
4 |
17 |
| Which Graphs are Determined by their Spectrum? |
0 |
0 |
0 |
5 |
2 |
2 |
8 |
29 |
| Which graphs are determined by their spectrum? |
0 |
0 |
1 |
15 |
0 |
0 |
7 |
53 |
| [Review of the book Handbook of Coding Theory I, II, V.S. Pless & W.C. Huffman, 2001] |
0 |
0 |
0 |
21 |
2 |
2 |
3 |
48 |
| Total Working Papers |
0 |
0 |
2 |
268 |
157 |
192 |
547 |
2,743 |
LogEc is hosted by the
Örebro University School of Business.