van Dam, Edwin R.

From MaRDI portal
Revision as of 05:36, 7 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:162970

Available identifiers

zbMath Open van-dam.edwin-rMaRDI QIDQ162970

List of research outcomes





PublicationDate of PublicationType
Spectra of power hypergraphs and signed graphs via parity-closed walks2024-07-03Paper
The characteristic polynomials of uniform double hyperstars and uniform hypertriangles2023-10-31Paper
All eigenvalues of the power hypergraph and signed subgraphs of a graph2023-09-05Paper
Matching extension and distance spectral radius2023-07-13Paper
Symmetry in complex unit gain graphs and their spectra2023-05-24Paper
Spectra of power hypergraphs and signed graphs via parity-closed walks2023-02-21Paper
Signless Laplacian Estrada index and Laplacian Estrada index of uniform hypergraphs2022-05-22Paper
On bipartite distance-regular Cayley graphs with small diameter2022-05-12Paper
Unit gain graphs with two distinct eigenvalues and systems of lines in complex space2022-04-11Paper
Pseudo-Geometric Strongly Regular Graphs with a Regular Point2022-04-10Paper
Spectral fundamentals and characterizations of signed directed graphs2022-01-20Paper
The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum2020-03-20Paper
Distance-regular Cayley graphs with small valency2020-02-21Paper
Trees with a large Laplacian eigenvalue multiplicity2019-12-19Paper
Directed strongly walk-regular graphs2018-08-29Paper
Partially metric association schemes with a multiplicity three2018-04-18Paper
Laplacian spectral characterization of roses2017-10-27Paper
Distance-regular Cayley graphs with least eigenvalue \(-2\)2017-07-21Paper
Some spectral and quasi-spectral characterizations of distance-regular graphs2016-08-01Paper
Distance-regular graphs2016-05-11Paper
New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph2015-12-14Paper
On Bounding the Bandwidth of Graphs with Symmetry2015-09-11Paper
Graphs with many valencies and few eigenvalues2015-08-17Paper
Semidefinite programming and eigenvalue bounds for the graph partition problem2015-06-19Paper
Uniformity in association schemes and coherent configurations: cometric \(Q\)-antipodal schemes and linked systems2015-06-19Paper
Regular graphs with maximal energy per vertex2014-08-29Paper
The Laplacian spectral excess theorem for distance-regular graphs2014-07-22Paper
Space-filling Latin hypercube designs for computer experiments2014-04-07Paper
Geometric aspects of 2-walk-regular graphs2014-02-19Paper
Nested maximin Latin hypercube designs2013-11-15Paper
Strongly walk-regular graphs2013-04-15Paper
A short proof of the odd-girth theorem2012-10-24Paper
Dual concepts of almost distance-regularity and the spectral excess theorem2012-08-10Paper
Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets2012-07-28Paper
An odd characterization of the generalized odd graphs2011-12-08Paper
Bounds for Maximin Latin Hypercube Designs2011-11-24Paper
Graphs whose normalized Laplacian has three eigenvalues2011-07-13Paper
On perturbations of almost distance-regular graphs2011-07-13Paper
On almost distance-regular graphs2011-04-11Paper
A lower bound for the spectral radius of graphs with fixed diameter2010-09-10Paper
Some implications on amorphic association schemes2010-04-27Paper
One-dimensional nested maximin designs2010-03-17Paper
Asymptotic results on the spectral radius and the diameter of graphs2009-12-18Paper
Maximin Latin Hypercube Designs in Two Dimensions2009-08-13Paper
Developments on spectral characterizations of graphs2009-04-08Paper
The spectral excess theorem for distance-regular graphs: a global (over)view2009-04-07Paper
Two-dimensional minimax Latin hypercube designs2009-03-04Paper
Spectral characterization of the Hamming graphs2008-11-06Paper
Graphs with given diameter maximizing the spectral radius2007-09-14Paper
The minimal spectral radius of graphs with a given diameter2007-05-10Paper
Cospectral graphs and the generalized adjacency matrix2007-04-18Paper
Characterizing distance-regularity of graphs by the spectrum2006-12-07Paper
A new family of distance-regular graphs with unbounded diameter2005-11-02Paper
The combinatorics of Dom de Caen2005-02-28Paper
Combinatorial designs with two singular values. II: Partial geometric designs2005-02-22Paper
Combinatorial designs with two singular values. I: Uniform multiplicative designs2004-08-06Paper
Which graphs are determined by their spectrum?2003-11-19Paper
Strongly regular decompositions of the complete graph2003-05-11Paper
Codes, graphs, and schemes from nonlinear functions2003-04-09Paper
Equitable resolvable coverings2003-04-03Paper
Spectral characterizations of some distance-regular graphs2002-05-30Paper
Fissioned triangular schemes via the cross-ratio2001-09-06Paper
Uniformly packed codes and more distance regular graphs from crooked functions2001-08-16Paper
A characterization of association schemes from affine spaces2001-07-09Paper
Association schemes related to Kasami codes and Kerdock sets2001-01-01Paper
Small regular graphs with four eigenvalues2000-11-02Paper
Fissions of classical self-dual association schemes1999-12-20Paper
A nonregular analogue of conference graphs1999-12-20Paper
A Cauchy-Khinchin matrix inequality1999-11-25Paper
Three-class association schemes1999-08-02Paper
Nonregular graphs with three eigenvalues1999-01-03Paper
Bounds on special subsets in graphs, eigenvalues and association schemes1998-07-15Paper
Graphs with constant \(\mu\) and \(\overline{\mu}\)1998-03-24Paper
A characterization of distance-regular graphs with diameter three1997-11-09Paper
https://portal.mardi4nfdi.de/entity/Q43437021997-07-06Paper
Regular graphs with four eigenvalues1996-06-18Paper
Eigenvalues and the diameter of graphs1996-02-12Paper
Classification of spreads of \(PG(3,4)\setminus PG(3,2)\)1993-08-29Paper
Rainbow Hamiltonicity and the spectral radiusN/APaper
Characterizations of amorphic schemes and fusions of pairsN/APaper

Research outcomes over time

This page was built for person: van Dam, Edwin R.