| Publication | Date of Publication | Type |
|---|
| The characteristic polynomials of uniform double hyperstars and uniform hypertriangles | 2023-10-31 | Paper |
| All eigenvalues of the power hypergraph and signed subgraphs of a graph | 2023-09-05 | Paper |
| Matching extension and distance spectral radius | 2023-07-13 | Paper |
| On bipartite distance-regular Cayley graphs with small diameter | 2022-05-12 | Paper |
| Unit gain graphs with two distinct eigenvalues and systems of lines in complex space | 2022-04-11 | Paper |
| Spectral fundamentals and characterizations of signed directed graphs | 2022-01-20 | Paper |
| The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum | 2020-03-20 | Paper |
| Distance-regular Cayley graphs with small valency | 2020-02-21 | Paper |
| Trees with a large Laplacian eigenvalue multiplicity | 2019-12-19 | Paper |
| Directed strongly walk-regular graphs | 2018-08-29 | Paper |
| Partially metric association schemes with a multiplicity three | 2018-04-18 | Paper |
| Laplacian spectral characterization of roses | 2017-10-27 | Paper |
| Distance-regular Cayley graphs with least eigenvalue \(-2\) | 2017-07-21 | Paper |
| Some spectral and quasi-spectral characterizations of distance-regular graphs | 2016-08-01 | Paper |
| Distance-regular graphs | 2016-05-11 | Paper |
| New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph | 2015-12-14 | Paper |
| On Bounding the Bandwidth of Graphs with Symmetry | 2015-09-11 | Paper |
| Graphs with many valencies and few eigenvalues | 2015-08-17 | Paper |
| Semidefinite programming and eigenvalue bounds for the graph partition problem | 2015-06-19 | Paper |
| Uniformity in association schemes and coherent configurations: cometric \(Q\)-antipodal schemes and linked systems | 2015-06-19 | Paper |
| Regular graphs with maximal energy per vertex | 2014-08-29 | Paper |
| The Laplacian spectral excess theorem for distance-regular graphs | 2014-07-22 | Paper |
| Space-filling Latin hypercube designs for computer experiments | 2014-04-07 | Paper |
| Geometric aspects of 2-walk-regular graphs | 2014-02-19 | Paper |
| Nested maximin Latin hypercube designs | 2013-11-15 | Paper |
| Strongly walk-regular graphs | 2013-04-15 | Paper |
| A short proof of the odd-girth theorem | 2012-10-24 | Paper |
| Dual concepts of almost distance-regularity and the spectral excess theorem | 2012-08-10 | Paper |
| Enhancement of Sandwich Algorithms for Approximating Higher-Dimensional Convex Pareto Sets | 2012-07-28 | Paper |
| An odd characterization of the generalized odd graphs | 2011-12-08 | Paper |
| Bounds for Maximin Latin Hypercube Designs | 2011-11-24 | Paper |
| Graphs whose normalized Laplacian has three eigenvalues | 2011-07-13 | Paper |
| On perturbations of almost distance-regular graphs | 2011-07-13 | Paper |
| On almost distance-regular graphs | 2011-04-11 | Paper |
| A lower bound for the spectral radius of graphs with fixed diameter | 2010-09-10 | Paper |
| Some implications on amorphic association schemes | 2010-04-27 | Paper |
| One-dimensional nested maximin designs | 2010-03-17 | Paper |
| Asymptotic results on the spectral radius and the diameter of graphs | 2009-12-18 | Paper |
| Maximin Latin Hypercube Designs in Two Dimensions | 2009-08-13 | Paper |
| Developments on spectral characterizations of graphs | 2009-04-08 | Paper |
| The spectral excess theorem for distance-regular graphs: a global (over)view | 2009-04-07 | Paper |
| Two-dimensional minimax Latin hypercube designs | 2009-03-04 | Paper |
| Spectral characterization of the Hamming graphs | 2008-11-06 | Paper |
| Graphs with given diameter maximizing the spectral radius | 2007-09-14 | Paper |
| The minimal spectral radius of graphs with a given diameter | 2007-05-10 | Paper |
| Cospectral graphs and the generalized adjacency matrix | 2007-04-18 | Paper |
| Characterizing distance-regularity of graphs by the spectrum | 2006-12-07 | Paper |
| A new family of distance-regular graphs with unbounded diameter | 2005-11-02 | Paper |
| The combinatorics of Dom de Caen | 2005-02-28 | Paper |
| Combinatorial designs with two singular values. II: Partial geometric designs | 2005-02-22 | Paper |
| Combinatorial designs with two singular values. I: Uniform multiplicative designs | 2004-08-06 | Paper |
| Which graphs are determined by their spectrum? | 2003-11-19 | Paper |
| Strongly regular decompositions of the complete graph | 2003-05-11 | Paper |
| Codes, graphs, and schemes from nonlinear functions | 2003-04-09 | Paper |
| Equitable resolvable coverings | 2003-04-03 | Paper |
| Spectral characterizations of some distance-regular graphs | 2002-05-30 | Paper |
| Fissioned triangular schemes via the cross-ratio | 2001-09-06 | Paper |
| Uniformly packed codes and more distance regular graphs from crooked functions | 2001-08-16 | Paper |
| A characterization of association schemes from affine spaces | 2001-07-09 | Paper |
| Association schemes related to Kasami codes and Kerdock sets | 2001-01-01 | Paper |
| Small regular graphs with four eigenvalues | 2000-11-02 | Paper |
| Fissions of classical self-dual association schemes | 1999-12-20 | Paper |
| A nonregular analogue of conference graphs | 1999-12-20 | Paper |
| A Cauchy-Khinchin matrix inequality | 1999-11-25 | Paper |
| Three-class association schemes | 1999-08-02 | Paper |
| Nonregular graphs with three eigenvalues | 1999-01-03 | Paper |
| Bounds on special subsets in graphs, eigenvalues and association schemes | 1998-07-15 | Paper |
| Graphs with constant \(\mu\) and \(\overline{\mu}\) | 1998-03-24 | Paper |
| A characterization of distance-regular graphs with diameter three | 1997-11-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4343702 | 1997-07-06 | Paper |
| Regular graphs with four eigenvalues | 1996-06-18 | Paper |
| Eigenvalues and the diameter of graphs | 1996-02-12 | Paper |
| Classification of spreads of \(PG(3,4)\setminus PG(3,2)\) | 1993-08-29 | Paper |
