Edwin van Dam

3.0k total citations · 1 hit paper
86 papers, 1.9k citations indexed

About

Edwin van Dam is a scholar working on Discrete Mathematics and Combinatorics, Geometry and Topology and Computational Theory and Mathematics. According to data from OpenAlex, Edwin van Dam has authored 86 papers receiving a total of 1.9k indexed citations (citations by other indexed papers that have themselves been cited), including 47 papers in Discrete Mathematics and Combinatorics, 42 papers in Geometry and Topology and 38 papers in Computational Theory and Mathematics. Recurrent topics in Edwin van Dam's work include Finite Group Theory Research (45 papers), Graph theory and applications (42 papers) and graph theory and CDMA systems (31 papers). Edwin van Dam is often cited by papers focused on Finite Group Theory Research (45 papers), Graph theory and applications (42 papers) and graph theory and CDMA systems (31 papers). Edwin van Dam collaborates with scholars based in Netherlands, China and South Korea. Edwin van Dam's co-authors include Willem H. Haemers, Dick den Hertog, B.G.M. Husslage, G. Rennen, Edward Spence, Hans Melissen, Jack H. Koolen, D. de Caen, G.R. Omidi and M.A. Fiol and has published in prestigious journals such as Operations Research, Inventiones mathematicae and Structural and Multidisciplinary Optimization.

In The Last Decade

Edwin van Dam

82 papers receiving 1.8k citations

Hit Papers

Which graphs are determined by their spectrum? 2003 2026 2010 2018 2003 100 200 300 400
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Which graphs are determined by their spectrum?
    2003 437 citations Edwin van Dam, Willem H. Haemers Linear Algebra and its Applications profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Edwin van Dam Netherlands 21 1.1k 1.0k 690 360 334 86 1.9k
R.B. Bapat India 21 907 0.9× 1.1k 1.1× 166 0.2× 231 0.6× 219 0.7× 123 1.8k
Gordon J. Savage Canada 12 448 0.4× 410 0.4× 95 0.1× 74 0.2× 208 0.6× 55 987
Robert F. Tichy Austria 20 573 0.5× 610 0.6× 241 0.3× 39 0.1× 33 0.1× 146 2.0k
Peter McMullen United Kingdom 29 1.0k 1.0× 791 0.8× 1.3k 1.9× 463 1.3× 24 0.1× 115 2.9k
Aleksandar Ilić Serbia 25 1.0k 1.0× 827 0.8× 209 0.3× 290 0.8× 472 1.4× 140 2.1k
J.J. Seidel Netherlands 21 440 0.4× 375 0.4× 555 0.8× 566 1.6× 41 0.1× 43 1.4k
Josef Leydold Austria 17 195 0.2× 303 0.3× 46 0.1× 78 0.2× 44 0.1× 54 955
T. S. Motzkin United States 19 343 0.3× 810 0.8× 187 0.3× 129 0.4× 64 0.2× 57 1.6k
Xiao‐Dong Zhang China 26 1.3k 1.3× 1.2k 1.1× 461 0.7× 141 0.4× 535 1.6× 191 2.3k
Monique Laurent Netherlands 24 232 0.2× 1.5k 1.5× 192 0.3× 358 1.0× 7 0.0× 125 2.2k

Countries citing papers authored by Edwin van Dam

Since Specialization
Citations

This map shows the geographic impact of Edwin van Dam's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Edwin van Dam with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Edwin van Dam more than expected).

Fields of papers citing papers by Edwin van Dam

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Edwin van Dam. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Edwin van Dam. The network helps show where Edwin van Dam may publish in the future.

Co-authorship network of co-authors of Edwin van Dam

This figure shows the co-authorship network connecting the top 25 collaborators of Edwin van Dam. A scholar is included among the top collaborators of Edwin van Dam based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Edwin van Dam. Edwin van Dam is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Dam, Edwin van, et al.. (2025). The Hoffman program for mixed graphs. Linear Algebra and its Applications. 726. 436–457.
2.
Dam, Edwin van, et al.. (2025). Rainbow Hamiltonicity and the spectral radius. Discrete Mathematics. 348(11). 114600–114600. 1 indexed citations
3.
Chen, Lixiang, Edwin van Dam, & Changjiang Bu. (2024). Spectra of power hypergraphs and signed graphs via parity-closed walks. Journal of Combinatorial Theory Series A. 207. 105909–105909.
4.
Dam, Edwin van, et al.. (2023). Matching extension and distance spectral radius. Linear Algebra and its Applications. 674. 244–255. 1 indexed citations
5.
Dam, Edwin van, et al.. (2016). Some spectral and quasi-spectral characterizations of distance-regular graphs. Journal of Combinatorial Theory Series A. 143. 1–18. 4 indexed citations
6.
Dam, Edwin van, Willem H. Haemers, & Jack H. Koolen. (2014). Regular graphs with maximal energy per vertex. Journal of Combinatorial Theory Series B. 107. 123–131. 6 indexed citations
7.
Dalfó, C., Edwin van Dam, M.A. Fiol, & E. Garriga. (2012). Dual concepts of almost distance-regularity and the spectral excess theorem. Discrete Mathematics. 312(17). 2730–2734. 5 indexed citations
8.
Dam, Edwin van & M.A. Fiol. (2012). A Short Proof of the Odd-Girth Theorem. The Electronic Journal of Combinatorics. 19(3). 4 indexed citations
9.
Husslage, B.G.M., G. Rennen, Edwin van Dam, & Dick den Hertog. (2011). Space-filling Latin hypercube designs for computer experiments. Other publications TiSEM. 7 indexed citations
10.
Dam, Edwin van & G.R. Omidi. (2011). Graphs whose normalized Laplacian has three eigenvalues. Linear Algebra and its Applications. 435(10). 2560–2569. 21 indexed citations
11.
Dalfó, C., Edwin van Dam, M.A. Fiol, E. Garriga, & Bram L. Gorissen. (2010). On almost distance-regular graphs. Journal of Combinatorial Theory Series A. 118(3). 1094–1113. 34 indexed citations
12.
Dam, Edwin van. (2008). Two-dimensional minimax Latin hypercube designs. Discrete Applied Mathematics. 156(18). 3483–3493. 14 indexed citations
13.
Dam, Edwin van & Edward Spence. (2004). Combinatorial designs with two singular values—I: uniform multiplicative designs. Journal of Combinatorial Theory Series A. 107(1). 127–142. 15 indexed citations
14.
Dam, Edwin van & D. Fon-Der-Flaass. (2003). Codes, graphs, and schemes from nonlinear functions. European Journal of Combinatorics. 24(1). 85–98. 20 indexed citations
15.
Dam, Edwin van & D. Fon-Der-Flaass. (2000). Codes, Graphs and Schemes from Nonlinear Functions. Research portal (Tilburg University). 790. 2 indexed citations
16.
Dam, Edwin van & Willem H. Haemers. (2000). Spectral Characterizations of Some Distance-Regular Graphs. Data Archiving and Networked Services (DANS). 793.
17.
Dam, Edwin van & Willem H. Haemers. (1998). Graphs with constant μ and μ. Discrete Mathematics. 182(1-3). 293–307. 40 indexed citations
18.
Dam, Edwin van. (1996). Graphs with few eigenvalues. An interplay between combinatorics and algebra. Data Archiving and Networked Services (DANS). 16 indexed citations
19.
Dam, Edwin van & Willem H. Haemers. (1995). Graphs with constant μ and μ. research memorandum. 1 indexed citations
20.
Dam, Edwin van. (1995). Bounds on separated pairs of subgraphs, eigenvalues and related polynomials. research memorandum. 1 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by R.B. Bapat Breakdown of academic impact, for papers by Gordon J. Savage Breakdown of academic impact, for papers by Robert F. Tichy Breakdown of academic impact, for papers by Peter McMullen Breakdown of academic impact, for papers by Aleksandar Ilić Breakdown of academic impact, for papers by J.J. Seidel Breakdown of academic impact, for papers by Josef Leydold Breakdown of academic impact, for papers by T. S. Motzkin Breakdown of academic impact, for papers by Xiao‐Dong Zhang Breakdown of academic impact, for papers by Monique Laurent
Rankless by CCL
2026