David Erwin
-
- Advanced Graph Theory Research 10
- Graph Labeling and Dimension Problems 8
- Complexity and Algorithms in Graphs 1
-
- Finite Group Theory Research 3
- Geometry and Topology top 10%
- Graph theory and applications 6
-
- Interconnection Networks and Systems 4
-
- graph theory and CDMA systems 6
-
- Synthesis and Properties of Aromatic Compounds 2
- Co-authors
- Gary ChartrandPing ZhangFrank HararyGarry L. JohnsMichael A. HenningSandra M. HedetniemiTeresa W. HaynesPeter J. Slater
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsGeometry and Topology
- Journals
- Discrete Mathematics (4 papers)Journal of Graph Theory (3 papers)Naval Research Logistics (NRL) (1 paper)
- Partner nations
- United StatesSouth AfricaCanada
In The Last Decade
David Erwin
15 papers receiving 200 citations
Peers
Comparison fields: 5 of 29
- Computational Theory and Mathematics 198
- Discrete Mathematics and Combinatorics 28
- Geometry and Topology 46
- Computer Graphics and Computer-Aided Design 9
- Computer Networks and Communications 32
Countries citing papers authored by David Erwin
This map shows the geographic impact of David Erwin'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 Erwin with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites David Erwin more than expected).
Fields of papers citing papers by David Erwin
This network shows the impact of papers produced by David Erwin. 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 Erwin. The network helps show where David Erwin may publish in the future.
Co-authorship network
The 22 scholars most cited alongside David Erwin, 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 | 2019 | 1 | |
| 2 | 2016 | 1 | |
| 3 | A characterisation of eccentric sequences of maximal outerplanar graphs. | 2014 | 1 |
| 4 | 2012 | 2 | |
| 5 | 2011 | 1 | |
| 6 | 2008 | 23 | |
| 7 | 2006 | 30 | |
| 8 | 2005 | 29 | |
| 9 | 2005 | 1 | |
| 10 | 2005 | 10 | |
| 11 | 2003 | 31 | |
| 12 | 2003 | 36 | |
| 13 | 2002 | 24 | |
| 14 | 2001 | 10 | |
| 15 | Cost Domination in Graphs | 2001 | 16 |
| 16 | 2001 | 2 |
About David Erwin
David Erwin is a scholar working on Discrete Mathematics and Combinatorics, Computational Theory and Mathematics, Geometry and Topology, Computer Networks and Communications and Electrical and Electronic Engineering, having authored 16 papers that have together received 218 indexed citations. Recurring topics across this work include Advanced Graph Theory Research (10 papers), Graph Labeling and Dimension Problems (8 papers), graph theory and CDMA systems (6 papers), Graph theory and applications (6 papers), Interconnection Networks and Systems (4 papers), Finite Group Theory Research (3 papers), Synthesis and Properties of Aromatic Compounds (2 papers) and Complexity and Algorithms in Graphs (1 paper). The work is most often cited by research in Computational Theory and Mathematics (198 citations), Discrete Mathematics and Combinatorics (28 citations), Geometry and Topology (46 citations), Computer Graphics and Computer-Aided Design (9 citations) and Computer Networks and Communications (32 citations). David Erwin has collaborated with scholars based in United States, South Africa and Canada. Frequent co-authors include Gary Chartrand, Ping Zhang, Frank Harary, Ping Zhang, Garry L. Johns, Michael A. Henning, Sandra M. Hedetniemi, Teresa W. Haynes, Peter J. Slater and Stephen T. Hedetniemi. Their work appears in journals such as Discrete Mathematics, Journal of Graph Theory, Naval Research Logistics (NRL), Discrete Applied Mathematics 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.