| Research methodology: An introduction W Goddard, S Melville Juta and Company Ltd, 2004 | 1684* | 2004 |
| Independent domination in graphs: A survey and recent results W Goddard, MA Henning Discrete Mathematics 313 (7), 839-854, 2013 | 319 | 2013 |
| A survey of integrity KS Bagga, LW Beineke, WD Goddard, MJ Lipman, RE Pippert Discrete Applied Mathematics 37, 13-28, 1992 | 187 | 1992 |
| Defective coloring revisited L Cowen, W Goddard, CE Jesurum Journal of Graph Theory 24 (3), 205-219, 1997 | 175 | 1997 |
| Broadcast chromatic numbers of graphs W Goddard, SM Hedetniemi, ST Hedetniemi, JM Harris, DF Rall Ars Combinatoria 86, 33-50, 2008 | 173 | 2008 |
| The average eccentricity of a graph and its subgraphs P Dankelmann, W Goddard, CS Swart Utilitas Mathematica 65 (05), 41-51, 2004 | 165 | 2004 |
| Vizing's conjecture: a survey and recent results B Brešar, P Dorbec, W Goddard, BL Hartnell, MA Henning, S Klavžar, ... Journal of Graph Theory 69 (1), 46-76, 2012 | 159 | 2012 |
| Eternal security in graphs W Goddard, SM Hedetniemi, ST Hedetniemi J. Combin. Math. Combin. Comput 52 (01), 2005 | 157 | 2005 |
| Distance in graphs W Goddard, OR Oellermann Structural Analysis of Complex Networks, 49-72, 2011 | 116 | 2011 |
| Offensive alliances in graphs O Favaron, G Fricke, W Goddard, SM Hedetniemi, ST Hedetniemi, ... International Symposium on Computer and Information Sciences, 298-302, 2022 | 111 | 2022 |
| Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks W Goddard, ST Hedetniemi, DP Jacobs, PK Srimani Proceedings International Parallel and Distributed Processing Symposium, 14 pp., 2003 | 90 | 2003 |
| Crossing families B Aronov, P Erdős, W Goddard, DJ Kleitman, M Klugerman, J Pach, ... Proceedings of the seventh annual symposium on Computational geometry, 351-356, 1991 | 90 | 1991 |
| Distance-two information in self-stabilizing algorithms M Gairing, W Goddard, ST Hedetniemi, P Kristiansen, AA McRae Parallel Processing Letters 14 (03n04), 387-398, 2004 | 84 | 2004 |
| Weakly pancyclic graphs S Brandt, R Faudree, W Goddard Journal of Graph Theory 27 (3), 141-176, 1998 | 77 | 1998 |
| Domination in planar graphs with small diameter W Goddard, MA Henning Journal of Graph Theory 40 (1), 1-25, 2002 | 74 | 2002 |
| A synchronous self-stabilizing minimal domination protocol in an arbitrary network graph Z Xu, ST Hedetniemi, W Goddard, PK Srimani Distributed Computing-IWDC 2003: 5th International Workshop, Kolkata, India …, 2003 | 73 | 2003 |
| Integrity in graphs: bounds and basics W Goddard, HC Swart J. Combin. Math. Combin. Comput 7, 139-151, 1990 | 73 | 1990 |
| The diameter of total domination vertex critical graphs W Goddard, TW Haynes, MA Henning, LC Van der Merwe Discrete mathematics 286 (3), 255-261, 2004 | 72 | 2004 |
| The agreement metric for labeled binary trees W Goddard, E Kubicka, G Kubicki, FR McMorris Mathematical Biosciences 123 (2), 215-226, 1994 | 72 | 1994 |
| Acyclic colorings of planar graphs W Goddard Discrete Mathematics 91 (1), 91-94, 1991 | 71 | 1991 |
