Wayne Goddard
Impact in
- Computational Theory and Mathematics top 0.2%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
- Graph Labeling and Dimension Problems
-
- Limits and Structures in Graph Theory
- Advanced Combinatorial Mathematics
Papers in
-
- Advanced Graph Theory Research 93
- Complexity and Algorithms in Graphs 23
- Graph Labeling and Dimension Problems 13
-
- Limits and Structures in Graph Theory 18
- Advanced Combinatorial Mathematics 7
- Co-authors
- Michael A. Henning (43 shared papers)Stephen T. Hedetniemi (25 shared papers)Pradip K. Srimani (14 shared papers)David Pokrass Jacobs (12 shared papers)Henda C. Swart (14 shared papers)Ortrud R. Oellermann (8 shared papers)Lenore Cowen (2 shared papers)C. Esther Jesurum (2 shared papers)
- Journals
- Discrete Mathematics (23 papers)Journal of Graph Theory (11 papers)Discrete Applied Mathematics (11 papers)Graphs and Combinatorics (6 papers)Journal of Combinatorial Optimization (4 papers)
- Partner nations
- United StatesSouth AfricaCanada
In The Last Decade
Wayne Goddard
131 papers receiving 2k citations
Peers
Comparison fields: 5 of 100
- Computational Theory and Mathematics 1.6k
- Discrete Mathematics and Combinatorics 218
- Computer Networks and Communications 315
- Geometry and Topology 144
- Computer Graphics and Computer-Aided Design 46
Countries citing papers authored by Wayne Goddard
This map shows the geographic impact of Wayne Goddard'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 Wayne Goddard with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Wayne Goddard more than expected).
Fields of papers citing papers by Wayne Goddard
This network shows the impact of papers produced by Wayne Goddard. 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 Wayne Goddard. The network helps show where Wayne Goddard may publish in the future.
Co-authors
The 25 scholars most cited alongside Wayne Goddard, 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 137 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2013 | 160 | |
| 2 | Research Methodology: An Introduction | 2004 | 135 |
| 3 | 1997 | 83 | |
| 4 | 2011 | 82 | |
| 5 | 1992 | 71 | |
| 6 | 2004 | 55 | |
| 7 | 1998 | 53 | |
| 8 | 2004 | 51 | |
| 9 | 2010 | 47 | |
| 10 | 2004 | 45 | |
| 11 | 2004 | 44 | |
| 12 | 2005 | 44 | |
| 13 | 1994 | 42 | |
| 14 | 2002 | 40 | |
| 15 | 2006 | 40 | |
| 16 | 1991 | 37 | |
| 17 | 1996 | 37 | |
| 18 | 2003 | 37 | |
| 19 | TOTAL AND PAIRED-DOMINATION NUMBERS OF A TREE | 2004 | 32 |
| 20 | 2012 | 31 |
About Wayne Goddard
Wayne Goddard is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Computer Networks and Communications, Geometry and Topology and Computer Graphics and Computer-Aided Design, having authored 137 papers that have together received 2.1k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (93 papers), Complexity and Algorithms in Graphs (23 papers), Distributed systems and fault tolerance (20 papers), Limits and Structures in Graph Theory (18 papers), Graph Labeling and Dimension Problems (13 papers), Optimization and Search Problems (10 papers), Graph theory and applications (9 papers) and Advanced Combinatorial Mathematics (7 papers). The work is most often cited by research in Computational Theory and Mathematics (1.6k citations), Discrete Mathematics and Combinatorics (218 citations), Computer Networks and Communications (315 citations), Geometry and Topology (144 citations) and Computer Graphics and Computer-Aided Design (46 citations). Wayne Goddard has collaborated with scholars based in United States, South Africa and Canada. Frequent co-authors include Michael A. Henning, Stephen T. Hedetniemi, Pradip K. Srimani, David Pokrass Jacobs, Henda C. Swart, Ortrud R. Oellermann, Lenore Cowen, C. Esther Jesurum, Sandra M. Hedetniemi and Teresa W. Haynes. Their work appears in journals such as Discrete Mathematics, Journal of Graph Theory, Discrete Applied Mathematics, Graphs and Combinatorics and Journal of Combinatorial Optimization.
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.