Wayne Goddard
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.2%
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in
-
- Advanced Graph Theory Research 96
- Graph Labeling and Dimension Problems 53
- Complexity and Algorithms in Graphs 28
-
- Optimization and Search Problems 23
- Distributed systems and fault tolerance 21
- Interconnection Networks and Systems 16
- Co-authors
- Michael A. Henning (43 shared papers)Stephen T. Hedetniemi (25 shared papers)Pradip K. Srimani (14 shared papers)Henda C. Swart (15 shared papers)David P. Jacobs (12 shared papers)Ortrud R. Oellermann (8 shared papers)C. Esther Jesurum (2 shared papers)Lenore Cowen (2 shared papers)
- Journals
- Discrete Mathematics (23 papers)Journal of Graph Theory (11 papers)Discrete Applied Mathematics (10 papers)Graphs and Combinatorics (6 papers)Journal of Combinatorial Optimization (4 papers)
- Partner nations
- United StatesSouth AfricaCanada
In The Last Decade
Wayne Goddard
129 papers receiving 1.9k citations
Peers
Comparison fields: 5 of 120
- Discrete Mathematics and Combinatorics 402
- Computational Theory and Mathematics 1.4k
- Geometry and Topology 355
- Computer Graphics and Computer-Aided Design 100
- Computer Networks and Communications 632
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 138 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2013 | 148 | |
| 2 | Research Methodology: An Introduction | 2004 | 141 |
| 3 | 1997 | 75 | |
| 4 | 2011 | 74 | |
| 5 | 1992 | 68 | |
| 6 | 2004 | 55 | |
| 7 | 2004 | 44 | |
| 8 | 2004 | 44 | |
| 9 | 2004 | 44 | |
| 10 | 2010 | 44 | |
| 11 | 2005 | 41 | |
| 12 | 1994 | 40 | |
| 13 | 1998 | 39 | |
| 14 | 2006 | 37 | |
| 15 | 2002 | 37 | |
| 16 | 1996 | 37 | |
| 17 | 2003 | 35 | |
| 18 | 1991 | 33 | |
| 19 | TOTAL AND PAIRED-DOMINATION NUMBERS OF A TREE | 2004 | 31 |
| 20 | 2008 | 29 |
About Wayne Goddard
Wayne Goddard is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics, Geometry and Topology and Electrical and Electronic Engineering, having authored 138 papers that have together received 2.0k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (96 papers), Graph Labeling and Dimension Problems (53 papers), Limits and Structures in Graph Theory (33 papers), Complexity and Algorithms in Graphs (28 papers), Graph theory and applications (27 papers), Optimization and Search Problems (23 papers), Distributed systems and fault tolerance (21 papers) and Interconnection Networks and Systems (16 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (402 citations), Computational Theory and Mathematics (1.4k citations), Geometry and Topology (355 citations), Computer Graphics and Computer-Aided Design (100 citations) and Computer Networks and Communications (632 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, Henda C. Swart, David P. Jacobs, Ortrud R. Oellermann, C. Esther Jesurum, Lenore Cowen, Teresa W. Haynes and Sandra M. Hedetniemi. 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.