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
-
- Limits and Structures in Graph Theory 7
-
- Advanced Graph Theory Research 28
- Graph Labeling and Dimension Problems 15
- Complexity and Algorithms in Graphs 8
- Co-authors
- Robert C. BrighamPhyllis Zweig ChinnGary ChartrandPing ZhangStephen T. HedetniemiKhurram ShafiqueTeresa W. HaynesRobert Lee
- Journals
- Discrete Mathematics (11 papers)Discrete Applied Mathematics (7 papers)Networks (3 papers)Journal of Combinatorial Theory Series B (2 papers)Graphs and Combinatorics (1 paper)
- Partner nations
- United States
In The Last Decade
Ronald D. Dutton
41 papers receiving 513 citations
Peers
Comparison fields: 5 of 59
- Computational Theory and Mathematics 460
- Discrete Mathematics and Combinatorics 81
- Geometry and Topology 156
- Computer Networks and Communications 127
- Computer Graphics and Computer-Aided Design 13
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-authorship network
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
| # | Work | ||
|---|---|---|---|
| 1 | Global Domination and Packing Numbers. | 2011 | 1 |
| 2 | 2009 | 2 | |
| 3 | 2008 | 21 | |
| 4 | 2008 | 3 | |
| 5 | Bounds on Powerful Alliance Numbers. | 2008 | 1 |
| 6 | 2007 | 22 | |
| 7 | 2007 | 19 | |
| 8 | 2005 | 0 | |
| 9 | An Equation Involving the Neighborhood (Two-Step) and Line Graphs. | 1999 | 3 |
| 10 | 1995 | 5 | |
| 11 | 1993 | 2 | |
| 12 | 1990 | 27 | |
| 13 | 1989 | 10 | |
| 14 | 1988 | 15 | |
| 15 | 1986 | 12 | |
| 16 | Bounds On Graph Spectra And Girth | 1985 | 1 |
| 17 | 1984 | 4 | |
| 18 | 1983 | 16 | |
| 19 | 1983 | 42 | |
| 20 | 1981 | 4 |
About Ronald D. Dutton
Ronald D. Dutton is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Computer Graphics and Computer-Aided Design and Computer Networks and Communications, having authored 45 papers that have together received 583 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (28 papers), Graph Labeling and Dimension Problems (15 papers), Graph theory and applications (10 papers), Complexity and Algorithms in Graphs (8 papers), Limits and Structures in Graph Theory (7 papers), Interconnection Networks and Systems (3 papers), Scheduling and Optimization Algorithms (3 papers) and graph theory and CDMA systems (3 papers). The work is most often cited by research in Computational Theory and Mathematics (460 citations), Discrete Mathematics and Combinatorics (81 citations), Geometry and Topology (156 citations), Computer Networks and Communications (127 citations) and Computer Graphics and Computer-Aided Design (13 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, Khurram Shafique, Teresa W. Haynes, Robert Lee, R. Mark Brigham and William F. Klostermeyer. Their work appears in journals such as Discrete Mathematics, Discrete Applied Mathematics, Networks, Journal of Combinatorial Theory Series B and Graphs and 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.