The following pages link to van Dam, Edwin R. (Q162970):
Displaying 44 items.
- (Q189376) (redirect page) (← links)
- (Q281528) (redirect page) (← links)
- Distance-regular graphs (Q281530) (← links)
- Nested maximin Latin hypercube designs (Q381446) (← links)
- Regular graphs with maximal energy per vertex (Q403366) (← links)
- Dual concepts of almost distance-regularity and the spectral excess theorem (Q442405) (← links)
- A short proof of the odd-girth theorem (Q456332) (← links)
- Some spectral and quasi-spectral characterizations of distance-regular graphs (Q530763) (← links)
- Graphs whose normalized Laplacian has three eigenvalues (Q550639) (← links)
- On perturbations of almost distance-regular graphs (Q550646) (← links)
- (Q592484) (redirect page) (← links)
- Combinatorial designs with two singular values. I: Uniform multiplicative designs (Q598442) (← links)
- An odd characterization of the generalized odd graphs (Q651037) (← links)
- Characterizing distance-regularity of graphs by the spectrum (Q855882) (← links)
- Cospectral graphs and the generalized adjacency matrix (Q876300) (← links)
- The minimal spectral radius of graphs with a given diameter (Q880046) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- Spectral characterization of the Hamming graphs (Q952057) (← links)
- Some implications on amorphic association schemes (Q966056) (← links)
- A lower bound for the spectral radius of graphs with fixed diameter (Q992783) (← links)
- Graphs with given diameter maximizing the spectral radius (Q996301) (← links)
- Two-dimensional minimax Latin hypercube designs (Q1003737) (← links)
- The spectral excess theorem for distance-regular graphs: a global (over)view (Q1010864) (← links)
- Developments on spectral characterizations of graphs (Q1011495) (← links)
- Asymptotic results on the spectral radius and the diameter of graphs (Q1044563) (← links)
- Classification of spreads of \(PG(3,4)\setminus PG(3,2)\) (Q1261005) (← links)
- Nonregular graphs with three eigenvalues (Q1272482) (← links)
- Three-class association schemes (Q1296390) (← links)
- A characterization of distance-regular graphs with diameter three (Q1361464) (← links)
- Graphs with constant \(\mu\) and \(\overline{\mu}\) (Q1379987) (← links)
- Bounds on special subsets in graphs, eigenvalues and association schemes (Q1386530) (← links)
- Which graphs are determined by their spectrum? (Q1414143) (← links)
- Small regular graphs with four eigenvalues (Q1584360) (← links)
- Association schemes related to Kasami codes and Kerdock sets (Q1591645) (← links)
- Uniformly packed codes and more distance regular graphs from crooked functions (Q1592955) (← links)
- Spectral characterizations of some distance-regular graphs (Q1597526) (← links)
- Directed strongly walk-regular graphs (Q1668674) (← links)
- Partially metric association schemes with a multiplicity three (Q1745731) (← links)
- Combinatorial designs with two singular values. II: Partial geometric designs (Q1763839) (← links)
- The combinatorics of Dom de Caen (Q1766102) (← links)
- Equitable resolvable coverings (Q4800408) (← links)
- The characteristic polynomials of uniform double hyperstars and uniform hypertriangles (Q6083981) (← links)
- Matching extension and distance spectral radius (Q6173921) (← links)
- All eigenvalues of the power hypergraph and signed subgraphs of a graph (Q6178777) (← links)
