David E. Daykin

78 papers receiving 771 citations

Peers

David E. Daykin
Comparison fields: 5 of 55
  • Discrete Mathematics and Combinatorics 443
  • Geometry and Topology 291
  • Computational Theory and Mathematics 445
  • Algebra and Number Theory 95
  • Theoretical Computer Science 21
Replace Imre Leader with:
Imre Leader United Kingdom
M. A. Tsfasman Russia
Neil J. Calkin United States
Gregory A. Freiman Israel
John L. Selfridge United States
Alfred Brauer United States
V. E. Hoggatt United States
John H. E. Cohn United Kingdom
Serge G. Vladut Russia
Heini Halberstam United States
David E. Daykin relative to Imre Leader United Kingdom Imre Leader's profile →
Citations per field
00.5×2×3×
Imre Leader · 1×
Citations per year

Countries citing papers authored by David E. Daykin

Since Specialization
Citations

This map shows the geographic impact of David E. Daykin'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 David E. Daykin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David E. Daykin more than expected).

Fields of papers citing papers by David E. Daykin

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by David E. Daykin. 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 David E. Daykin. The network helps show where David E. Daykin may publish in the future.

Co-authors

The 23 scholars most cited alongside David E. Daykin, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.

Border = papers with David E. Daykin Line = papers co-authored together David E. Daykin links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 85 papers — load more, or switch the sort, to bring in the rest.

#Work
1 197898
2 197684
3 196047
4 197647
5 197442
6 197440
7 197436
8 198136
9 197125
10 197923
11 197118
12 197617
13 200316
14 197215
15 197913
16 200912
17 196011
18 197611
19 198111
20 200811

About David E. Daykin

David E. Daykin is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Discrete Mathematics and Combinatorics, Algebra and Number Theory and Applied Mathematics, having authored 85 papers that have together received 858 indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (14 papers), graph theory and CDMA systems (13 papers), Advanced Graph Theory Research (11 papers), Mathematical Inequalities and Applications (10 papers), Mathematics and Applications (9 papers), semigroups and automata theory (9 papers), Graph theory and applications (9 papers) and Functional Equations Stability Results (9 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (443 citations), Geometry and Topology (291 citations), Computational Theory and Mathematics (445 citations), Algebra and Number Theory (95 citations) and Theoretical Computer Science (21 citations). David E. Daykin has collaborated with scholars based in United Kingdom, Malaysia and Australia. Frequent co-authors include Rudolf Ahlswede, Béla Bollobás, P. Erdös, Alan Brace, Roland Häggkvist, A. J. W. Hilton, C. JAYARATNAM ELIEZER, W.F. Smyth, Péter Frankl and Douglas B. West. Their work appears in journals such as Journal of Combinatorial Theory Series A, Mathematika, Journal of the London Mathematical Society, The Quarterly Journal of Mathematics and Proceedings of the American Mathematical Society.

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