Ronald D. Dutton
Impact in
-
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
-
- Limits and Structures in Graph Theory
Papers in
-
- Advanced Graph Theory Research 30
- Graph Labeling and Dimension Problems 15
- Complexity and Algorithms in Graphs 8
-
- Limits and Structures in Graph Theory 8
- Co-authors
- Robert C. Brigham (36 shared papers)Phyllis Zweig Chinn (3 shared papers)Gary Chartrand (2 shared papers)Ping Zhang (1 shared paper)Stephen T. Hedetniemi (2 shared papers)Teresa W. Haynes (4 shared papers)Robert Lee (1 shared paper)Khurram Shafique (1 shared paper)
- Journals
- Discrete Mathematics (11 papers)Discrete Applied Mathematics (7 papers)Networks (3 papers)Journal of Combinatorial Theory Series B (2 papers)European Journal of Combinatorics (1 paper)
- Partner nations
- United States
In The Last Decade
Ronald D. Dutton
47 papers receiving 592 citations
Peers
Comparison fields: 5 of 60
- Computational Theory and Mathematics 518
- Discrete Mathematics and Combinatorics 93
- Geometry and Topology 172
- Computer Networks and Communications 140
- Computer Graphics and Computer-Aided Design 15
Countries citing papers authored by Ronald D. Dutton
This map shows the geographic impact of Ronald D. Dutton'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 Ronald D. Dutton with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Ronald D. Dutton more than expected).
Fields of papers citing papers by Ronald D. Dutton
This network shows the impact of papers produced by Ronald D. Dutton. 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 Ronald D. Dutton. The network helps show where Ronald D. Dutton may publish in the future.
Co-authors
The 15 scholars most cited alongside Ronald D. Dutton, 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 48 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 1988 | 101 | |
| 2 | 2003 | 79 | |
| 3 | 1983 | 48 | |
| 4 | 1981 | 36 | |
| 5 | 1993 | 34 | |
| 6 | 1990 | 29 | |
| 7 | 2008 | 25 | |
| 8 | 1991 | 25 | |
| 9 | 1985 | 24 | |
| 10 | 2007 | 23 | |
| 11 | 2007 | 19 | |
| 12 | 1986 | 18 | |
| 13 | 1988 | 16 | |
| 14 | 1983 | 16 | |
| 15 | 1991 | 15 | |
| 16 | 1983 | 14 | |
| 17 | 1984 | 14 | |
| 18 | 2009 | 12 | |
| 19 | 1989 | 12 | |
| 20 | 1990 | 10 |
About Ronald D. Dutton
Ronald D. Dutton is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Computer Networks and Communications and Signal Processing, having authored 48 papers that have together received 657 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (30 papers), Graph Labeling and Dimension Problems (15 papers), Graph theory and applications (9 papers), Limits and Structures in Graph Theory (8 papers), Complexity and Algorithms in Graphs (8 papers), graph theory and CDMA systems (5 papers), Data Management and Algorithms (4 papers) and Data Visualization and Analytics (4 papers). The work is most often cited by research in Computational Theory and Mathematics (518 citations), Discrete Mathematics and Combinatorics (93 citations), Geometry and Topology (172 citations), Computer Networks and Communications (140 citations) and Computer Graphics and Computer-Aided Design (15 citations). Ronald D. Dutton has collaborated with scholars based in United States. Frequent co-authors include Robert C. Brigham, Phyllis Zweig Chinn, Gary Chartrand, Ping Zhang, Stephen T. Hedetniemi, Teresa W. Haynes, Robert Lee, Khurram Shafique, R. Mark Brigham and Mary M. Miller. Their work appears in journals such as Discrete Mathematics, Discrete Applied Mathematics, Networks, Journal of Combinatorial Theory Series B and European Journal of Combinatorics.
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.