D. E. Daykin
Impact in
-
- Limits and Structures in Graph Theory
- Geometry and Topology top 2%
- Graph theory and applications
- Advanced Topology and Set Theory
Papers in
-
- Advanced Graph Theory Research 10
- semigroups and automata theory 7
-
- Mathematics and Applications 9
- Graph theory and applications 9
- Co-authors
- Rudolf Ahlswede (4 shared papers)B. Bollobás (1 shared paper)P. Erdös (1 shared paper)Alan Brace (5 shared papers)Roland Häggkvist (2 shared papers)A. J. W. Hilton (5 shared papers)Péter Frankl (4 shared papers)C. J. Eliezer (5 shared papers)
- Journals
- Journal of Combinatorial Theory Series A (7 papers)Journal of the London Mathematical Society (5 papers)Mathematika (5 papers)The Quarterly Journal of Mathematics (5 papers)Proceedings of the American Mathematical Society (3 papers)
- Partner nations
- United KingdomMalaysiaUnited States
In The Last Decade
D. E. Daykin
73 papers receiving 615 citations
Peers
Comparison fields: 5 of 53
- Discrete Mathematics and Combinatorics 376
- Geometry and Topology 234
- Computational Theory and Mathematics 367
- Algebra and Number Theory 79
- Theoretical Computer Science 13
Countries citing papers authored by D. E. Daykin
This map shows the geographic impact of D. 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 D. 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 D. E. Daykin more than expected).
Fields of papers citing papers by D. E. Daykin
This network shows the impact of papers produced by D. 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 D. E. Daykin. The network helps show where D. E. Daykin may publish in the future.
Co-authors
The 25 scholars most cited alongside D. E. Daykin, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 81 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1978 | 82 | |
| 2 | 1976 | 76 | |
| 3 | 1960 | 41 | |
| 4 | 1976 | 40 | |
| 5 | 1974 | 35 | |
| 6 | 1974 | 34 | |
| 7 | 1974 | 31 | |
| 8 | 1981 | 31 | |
| 9 | 1971 | 21 | |
| 10 | 1976 | 16 | |
| 11 | 1971 | 16 | |
| 12 | 1979 | 15 | |
| 13 | 1972 | 13 | |
| 14 | 2003 | 12 | |
| 15 | 1981 | 11 | |
| 16 | 1985 | 10 | |
| 17 | 1984 | 9 | |
| 18 | 1979 | 9 | |
| 19 | 1960 | 9 | |
| 20 | 2008 | 8 |
About D. E. Daykin
D. E. Daykin is a scholar working on Computational Theory and Mathematics, Geometry and Topology, Discrete Mathematics and Combinatorics, Applied Mathematics and Electrical and Electronic Engineering, having authored 81 papers that have together received 695 indexed citations. Recurring topics across this work include graph theory and CDMA systems (13 papers), Limits and Structures in Graph Theory (13 papers), Advanced Graph Theory Research (10 papers), Mathematical Inequalities and Applications (10 papers), Functional Equations Stability Results (9 papers), Mathematics and Applications (9 papers), Graph theory and applications (9 papers) and semigroups and automata theory (7 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (376 citations), Geometry and Topology (234 citations), Computational Theory and Mathematics (367 citations), Algebra and Number Theory (79 citations) and Theoretical Computer Science (13 citations). D. E. Daykin has collaborated with scholars based in United Kingdom, Malaysia and United States. Frequent co-authors include Rudolf Ahlswede, B. Bollobás, P. Erdös, Alan Brace, Roland Häggkvist, A. J. W. Hilton, Péter Frankl, C. J. Eliezer, W.F. Smyth and Douglas B. West. Their work appears in journals such as Journal of Combinatorial Theory Series A, Journal of the London Mathematical Society, Mathematika, 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.