David E. Daykin

73 papers receiving 786 citations

Peers

David E. Daykin
Comparison fields: 5 of 33
  • Discrete Mathematics and Combinatorics 561
  • Algebra and Number Theory 55
  • Computational Theory and Mathematics 119
  • Applied Mathematics 93
  • Geometry and Topology 45
Replace L. Bruce Richmond with:
L. Bruce Richmond Canada
Arnold Knopfmacher South Africa
Alfred Brauer United States
Peter J.-S. Shiue United States
W. H. Mills United States
Jay R. Goldman United States
Helge Tverberg Norway
Gregory A. Freiman Israel
Curtis Greene United States
Peter M. Gibson United States
David E. Daykin relative to L. Bruce Richmond Canada L. Bruce Richmond's profile →
Citations per field
00.5×2×2.7×
L. Bruce Richmond · 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 24 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 79 papers — load more, or switch the sort, to bring in the rest.

#Work
1 1978102
2 197688
3 196049
4 197648
5 197445
6 197440
7 198137
8 197436
9 197126
10 197923
11 197618
12 197116
13 200316
14 197215
15 196014
16 197913
17 197612
18 200912
19 198111
20 200811

About David E. Daykin

David E. Daykin is a scholar working on Discrete Mathematics and Combinatorics, Algebra and Number Theory, Geometry and Topology, Applied Mathematics and Computational Theory and Mathematics, having authored 79 papers that have together received 867 indexed citations. Recurring topics across this work include Advanced Combinatorial Mathematics (36 papers), Mathematical Inequalities and Applications (10 papers), Analytic Number Theory Research (8 papers), Mathematics and Applications (6 papers), Limits and Structures in Graph Theory (6 papers), Algorithms and Data Compression (5 papers), Advanced Mathematical Theories and Applications (5 papers) and Advanced Graph Theory Research (4 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (561 citations), Algebra and Number Theory (55 citations), Computational Theory and Mathematics (119 citations), Applied Mathematics (93 citations) and Geometry and Topology (45 citations). David E. Daykin has collaborated with scholars based in United Kingdom, Malaysia and Australia. Frequent co-authors include Rudolf Ahlswede, Paul L. Erdos, Béla Bollobás, Alan Brace, Roland Häggkvist, A. J. W. Hilton, W.F. Smyth, Péter Frankl, C. JAYARATNAM ELIEZER and Douglas B. West. Their work appears in journals such as Journal of Combinatorial Theory Series A, Journal of the London Mathematical Society, The Quarterly Journal of Mathematics, Mathematika 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