Wayne Goddard

2.9k total citations
125 papers, 1.4k citations indexed

About

Wayne Goddard is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications and Discrete Mathematics and Combinatorics. According to data from OpenAlex, Wayne Goddard has authored 125 papers receiving a total of 1.4k indexed citations (citations by other indexed papers that have themselves been cited), including 103 papers in Computational Theory and Mathematics, 35 papers in Computer Networks and Communications and 35 papers in Discrete Mathematics and Combinatorics. Recurrent topics in Wayne Goddard's work include Advanced Graph Theory Research (91 papers), Graph Labeling and Dimension Problems (50 papers) and Limits and Structures in Graph Theory (32 papers). Wayne Goddard is often cited by papers focused on Advanced Graph Theory Research (91 papers), Graph Labeling and Dimension Problems (50 papers) and Limits and Structures in Graph Theory (32 papers). Wayne Goddard collaborates with scholars based in United States, South Africa and Canada. Wayne Goddard's co-authors include Michael A. Henning, Stephen T. Hedetniemi, Henda C. Swart, C. Esther Jesurum, Lenore Cowen, David P. Jacobs, Pradip K. Srimani, Sandra M. Hedetniemi, Teresa W. Haynes and Grzegorz Kubicki and has published in prestigious journals such as SIAM Journal on Computing, Applied Mathematics and Computation and Mathematical Biosciences.

In The Last Decade

Wayne Goddard

116 papers receiving 1.3k citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
Wayne Goddard United States	20	1.1k	444	342	274	163	125	1.4k
Van Bang Lê Germany	14	1.3k 1.1×	419 0.9×	329 1.0×	274 1.0×	154 0.9×	77	1.5k
Feodor F. Dragan United States	20	781 0.7×	275 0.6×	147 0.4×	245 0.9×	115 0.7×	82	1.0k
Stéphan Thomassé France	16	877 0.8×	177 0.4×	341 1.0×	144 0.5×	161 1.0×	94	990
Paul A. Catlin United States	17	826 0.7×	331 0.7×	421 1.2×	336 1.2×	164 1.0×	36	1.1k
Andreas Brandstädt Germany	25	2.3k 2.0×	690 1.6×	657 1.9×	457 1.7×	272 1.7×	110	2.5k
Michael Tarsi Israel	20	873 0.8×	217 0.5×	436 1.3×	151 0.6×	404 2.5×	37	1.2k
Ortrud R. Oellermann Canada	21	1.6k 1.4×	291 0.7×	203 0.6×	686 2.5×	428 2.6×	87	1.8k
Jan Arne Telle Norway	16	720 0.6×	343 0.8×	131 0.4×	82 0.3×	71 0.4×	69	864
André Raspaud France	24	1.6k 1.4×	289 0.7×	680 2.0×	216 0.8×	374 2.3×	132	1.8k
Ian Holyer United Kingdom	5	561 0.5×	194 0.4×	217 0.6×	70 0.3×	205 1.3×	20	788

Countries citing papers authored by Wayne Goddard

Since Specialization

Citations

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

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

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-authorship network of co-authors of Wayne Goddard

This figure shows the co-authorship network connecting the top 25 collaborators of Wayne Goddard. A scholar is included among the top collaborators of Wayne Goddard based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Wayne Goddard. Wayne Goddard is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

Goddard, Wayne, et al.. (2025). Bounds on independent isolation in graphs. Discrete Applied Mathematics. 372. 143–149.

Goddard, Wayne, et al.. (2024). Disjoint isolating sets and graphs with maximum isolation number. Discrete Applied Mathematics. 356. 110–116. 6 indexed citations

Goddard, Wayne, et al.. (2024). Domination parameters and the removal of matchings. Applied Mathematics and Computation. 476. 128752–128752.

Dankelmann, Peter, et al.. (2021). The maximum average connectivity among all orientations of a graph. idUS (Universidad de Sevilla). 1 indexed citations

Goddard, Wayne & Michael A. Henning. (2017). Thoroughly dispersed colorings. Journal of Graph Theory. 88(1). 174–191. 10 indexed citations

Goddard, Wayne & Michael A. Henning. (2013). Independent domination in graphs: A survey and recent results. Discrete Mathematics. 313(7). 839–854. 132 indexed citations

Goddard, Wayne. (2008). Introducing the Theory of Computation. Medical Entomology and Zoology. 2(11). 44–44. 6 indexed citations

Goddard, Wayne, et al.. (2006). Domination in Planar Graphs with Small Diameter II.. Ars Combinatoria. 78. 13 indexed citations

Goddard, Wayne, et al.. (2006). Construction of trees and graphs with equal domination parameters. Discrete Mathematics. 306(21). 2647–2654. 30 indexed citations

10.

Goddard, Wayne, et al.. (2005). On the graphs with maximum distance or $k$-diameter. Mathematica Slovaca. 55(2). 131–139. 8 indexed citations

11.

Goddard, Wayne, et al.. (2005). Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. Discrete Mathematics. 300(1-3). 82–90. 4 indexed citations

12.

Goddard, Wayne, Sandra M. Hedetniemi, Stephen T. Hedetniemi, & Renu Laskar. (2005). Generalized subgraph-restricted matchings in graphs. Discrete Mathematics. 293(1-3). 129–138. 29 indexed citations

13.

Chellali, Mustapha, Teresa W. Haynes, & Wayne Goddard. (2004). TOTAL AND PAIRED-DOMINATION NUMBERS OF A TREE. AKCE International Journal of Graphs and Combinatorics. 25 indexed citations

14.

Day, David P., Wayne Goddard, Michael A. Henning, & Henda C. Swart. (2001). Multipartite Ramsey Numbers.. Ars Combinatoria. 58. 7 indexed citations

15.

Goddard, Wayne & Michael A. Henning. (2001). Pancyclicity of the prism. Discrete Mathematics. 234(1-3). 139–142. 12 indexed citations

16.

Goddard, Wayne, Ortrud R. Oellermann, Peter J. Slater, & Henda C. Swart. (1999). Bounds on the Total Redundance and Efficiency of a Graph.. Ars Combinatoria. 54. 4 indexed citations

17.

Cowen, Lenore, Wayne Goddard, & C. Esther Jesurum. (1997). Coloring with defect. Symposium on Discrete Algorithms. 548–557. 16 indexed citations

18.

Goddard, Wayne & Henda C. Swart. (1996). Distances between graphs under edge operations. Discrete Mathematics. 161(1-3). 121–132. 18 indexed citations

19.

Goddard, Wayne & Daniel J. Kleitman. (1994). An upper bound for the Ramsey numbers r(K3,G). Discrete Mathematics. 125(1-3). 177–182. 3 indexed citations

20.

Beineke, Lowell W., et al.. (1992). A survey of integrity. Discrete Applied Mathematics. 37-38. 13–28. 59 indexed citations

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.

Explore authors with similar magnitude of impact