Wayne Goddard

Publication Activity (10 Years)

Years Active: 1990-2024
Publications (10 Years): 21

Top Venues

Discret. Appl. Math.

J. Comb. Optim.

Appl. Math. Comput.

Discuss. Math. Graph Theory

Publications

Geoffrey Boyer, Wayne Goddard, Michael A. Henning
Domination parameters and the removal of matchings. Appl. Math. Comput. 476 (2024)
Wayne Goddard, Michael A. Henning
The packing number of cubic graphs. Discret. Optim. 53 (2024)
Wayne Goddard, Julia VanLandingham
The fully weighted toughness of a graph. Discret. Appl. Math. 343 (2024)
Geoffrey Boyer, Wayne Goddard
Disjoint isolating sets and graphs with maximum isolation number. Discret. Appl. Math. 356 (2024)
Wayne Goddard, Michael A. Henning
Graphs with Unique Minimum Specified Domination Sets. Graphs Comb. 39 (5) (2023)
Wayne Goddard, Michael A. Henning
Independent domination in outerplanar graphs. Discret. Appl. Math. 325 (2023)
Wayne Goddard, Michael A. Henning
Domination and dominator colorings in planar graphs with small diameter. Discret. Appl. Math. 313 (2022)
Rocío M. Casablanca, Peter Dankelmann, Wayne Goddard, Lucas Mol, Ortrud Oellermann
The maximum average connectivity among all orientations of a graph. J. Comb. Optim. 43 (3) (2022)
Wayne Goddard, Kirsti Kuenzel, Eileen Melville
Well-hued graphs. Discret. Appl. Math. 320 (2022)
Anna Bachstein, Wayne Goddard, Michael A. Henning, John Xue
Compelling colorings: A generalization of the dominator chromatic number. Appl. Math. Comput. 428 (2022)
Anna Bachstein, Wayne Goddard, Connor Lehmacher
The generalized matcher game. Discret. Appl. Math. 284 (2020)
Wayne Goddard, Michael A. Henning
Independent domination, colorings and the fractional idomatic number of a graph. Appl. Math. Comput. 382 (2020)
Wayne Goddard, Robert Melville, Honghai Xu
Almost injective colorings. Discuss. Math. Graph Theory 39 (1) (2019)
Wayne Goddard, Robert Melville
Properly colored trails, paths, and bridges. J. Comb. Optim. 35 (2) (2018)
Wayne Goddard, Michael A. Henning
The matcher game played in graphs. Discret. Appl. Math. 237 (2018)
Wayne Goddard, Michael A. Henning
A note on domination and total domination in prisms. J. Comb. Optim. 35 (1) (2018)
Wayne Goddard, Michael A. Henning
Thoroughly dispersed colorings. J. Graph Theory 88 (1) (2018)
Robert Melville, Wayne Goddard
Coloring Graphs to Produce Properly Colored Walks. Graphs Comb. 33 (5) (2017)
Wayne Goddard, Honghai Xu
Fractional, Circular, and Defective Coloring of Series-Parallel Graphs. J. Graph Theory 81 (2) (2016)
Wayne Goddard, Honghai Xu
Vertex colorings without rainbow subgraphs. Discuss. Math. Graph Theory 36 (4) (2016)
Wayne Goddard, Kirsti Wash, Honghai Xu
WORM colorings. Discuss. Math. Graph Theory 35 (3) (2015)
Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart
A characterisation of eccentric sequences of maximal outerplanar graphs. Australas. J Comb. 58 (2014)
Wayne Goddard, Honghai Xu
A note on S-packing colorings of lattices. Discret. Appl. Math. 166 (2014)
Wayne Goddard, Pradip K. Srimani
Daemon Conversions in Distributed Self-stabilizing Algorithms. WALCOM (2013)
Wayne Goddard, Michael A. Henning
Independent domination in graphs: A survey and recent results. Discret. Math. 313 (7) (2013)
Wayne Goddard, Ewa M. Kubicka, Grzegorz Kubicki
An efficient algorithm for stopping on a sink in a directed graph. Oper. Res. Lett. 41 (3) (2013)
Peter Dankelmann, David Erwin, Wayne Goddard, Simon Mukwembi, Henda C. Swart
Eccentric counts, connectivity and chordality. Inf. Process. Lett. 112 (24) (2012)
Bostjan Bresar, Paul Dorbec, Wayne Goddard, Bert L. Hartnell, Michael A. Henning, Sandi Klavzar, Douglas F. Rall
Vizing's conjecture: a survey and recent results. J. Graph Theory 69 (1) (2012)
Wayne Goddard, Pradip K. Srimani
Self-Stabilizing Master-Slave Token Circulation and Efficient Size-Computation in a Unidirectional Ring of Arbitrary Size. Int. J. Found. Comput. Sci. 23 (4) (2012)
Wayne Goddard, Honghai Xu
-packing chromatic number of a graph. Discuss. Math. Graph Theory 32 (4) (2012)
Wayne Goddard, Jeremy Lyle
Independent dominating sets in triangle-free graphs. J. Comb. Optim. 23 (1) (2012)
Wayne Goddard, Jeremy Lyle
Dense graphs with small clique number. J. Graph Theory 66 (4) (2011)
Wayne Goddard, Pradip K. Srimani
Self-Stabilizing Master-Slave Token Circulation and Efficient Topology Computation in a Tree of Arbitrary Size. IPDPS Workshops (2011)
Ermelinda DeLaViña, Wayne Goddard, Michael A. Henning, Ryan Pepper, Emil R. Vaughan
Bounds on the k-domination number of a graph. Appl. Math. Lett. 24 (6) (2011)
Wayne Goddard, Stephen T. Hedetniemi, James L. Huff, Alice A. McRae
Capacitated Domination. Ars Comb. 96 (2010)
Wayne Goddard, Pradip K. Srimani
Self-stabilizing master-slave token circulation and efficient size-computation in a unidirectional ring of arbitrary size. IPDPS Workshops (2010)
Jeremy Lyle, Wayne Goddard
The binding number of a graph and its cliques. Discret. Appl. Math. 157 (15) (2009)
Wayne Goddard, Stephen T. Hedetniemi
A note on trees, tables, and algorithms. Networks 53 (2) (2009)
Wayne Goddard, Michael A. Henning
A Characterization of Cubic Graphs with Paired-Domination Number Three-Fifths Their Order. Graphs Comb. 25 (5) (2009)
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
Distance- k knowledge in self-stabilizing algorithms. Theor. Comput. Sci. 399 (1-2) (2008)
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space. ICDCN (2008)
Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall
Braodcast Chromatic Numbers of Graphs. Ars Comb. 86 (2008)
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani, Zhenyu Xu
Self-Stabilizing Graph Protocols. Parallel Process. Lett. 18 (1) (2008)
Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steven B. Horton, Patrick Jones, Grzegorz Kubicki
On domination and reinforcement numbers in trees. Discret. Math. 308 (7) (2008)
Wayne Goddard, Kiran Kanakadandi
Orientation distance graphs revisited. Discuss. Math. Graph Theory 27 (1) (2007)
Wayne Goddard, Michael A. Henning
Restricted domination parameters in graphs. J. Comb. Optim. 13 (4) (2007)
Wayne Goddard, Stephen T. Hedetniemi, Zhengnan Shi
An Anonymous Self-Stabilizing Algorithm for 1-Maximal Matching in Trees. PDPTA (2006)
Peter Dankelmann, Michael A. Henning, Wayne Goddard, Renu C. Laskar
Simultaneous graph parameters: Factor domination and factor total domination. Discret. Math. 306 (18) (2006)
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Vilmar Trevisan
Information in Self-stabilizing Algorithms. SIROCCO (2006)
Michael Dorfling, Wayne Goddard, Michael A. Henning, Christina M. Mynhardt
Construction of trees and graphs with equal domination parameters. Discret. Math. 306 (21) (2006)
Michael Dorfling, Wayne Goddard, Michael A. Henning
Domination in Planar Graphs with Small Diameter II. Ars Comb. 78 (2006)
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
Self-Stabilizing Global Optimization Algorithms for Large Network Graphs. Int. J. Distributed Sens. Networks 1 (3&4) (2005)
Wayne Goddard, Michael A. Henning
Multiple vertex coverings by cliques. J. Graph Theory 48 (2) (2005)
Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi, Ken Kennedy, Renu C. Laskar, Alice A. McRae
An algorithm for partial Grundy number on trees. Discret. Math. 304 (1-3) (2005)
Michael Dorfling, Wayne Goddard, Johannes H. Hattingh, Michael A. Henning
Augmenting a graph of minimum degree 2 to have two disjoint total dominating sets. Discret. Math. 300 (1-3) (2005)
Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu C. Laskar
Generalized subgraph-restricted matchings in graphs. Discret. Math. 293 (1-3) (2005)
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
Self-Stabilizing Algorithms For Orderings And Colorings. Int. J. Found. Comput. Sci. 16 (1) (2005)
Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, Petter Kristiansen, Alice A. McRae
Distance-two information in self-stabilizing algorithms. Parallel Process. Lett. 14 (3-4) (2004)
Martin Gairing, Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs
Self-Stabilizing Maximal K-Dependent Sets In Linear Time. Parallel Process. Lett. 14 (1) (2004)
Odile Favaron, Gerd Fricke, Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Petter Kristiansen, Renu C. Laskar, R. Duane Skaggs
Offensive alliances in graphs. Discuss. Math. Graph Theory 24 (2) (2004)
Peter Dankelmann, Gayla S. Domke, Wayne Goddard, Paul J. P. Grobler, Johannes H. Hattingh, Henda C. Swart
Maximum sizes of graphs with given domination parameters. Discret. Math. 281 (1-3) (2004)
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
Fault Tolerant Algorithms for Orderings and Colorings. IPDPS (2004)
Zhengnan Shi, Wayne Goddard, Stephen T. Hedetniemi
An anonymous self-stabilizing algorithm for 1-maximal independent set in trees. Inf. Process. Lett. 91 (2) (2004)
Wayne Goddard, Teresa W. Haynes, Michael A. Henning, Lucas C. van der Merwe
The diameter of total domination vertex critical graphs. Discret. Math. 286 (3) (2004)
Wayne Goddard
Minimum Degree Conditions for Cycles Including Specified Sets of Vertices. Graphs Comb. 20 (4) (2004)
Wayne Goddard, Teresa W. Haynes, Debra J. Knisley
Hereditary domination and independence parameters . Discuss. Math. Graph Theory 24 (2) (2004)
Wayne Goddard, Michael Edwin Raines, Peter J. Slater
Distance and connectivity measures in permutation graphs. Discret. Math. 271 (1-3) (2003)
Wayne Goddard
A computer / human mastermind player using grids. South Afr. Comput. J. 30 (2003)
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Time. ICDCS Workshops (2003)
Elias Dahlhaus, Peter Dankelmann, Wayne Goddard, Henda C. Swart
MAD trees and distance-hereditary graphs. Discret. Appl. Math. 131 (1) (2003)
Zhenyu Xu, Stephen T. Hedetniemi, Wayne Goddard, Pradip K. Srimani
A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph. IWDC (2003)
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph. HiPC (2003)
Ernest J. Cockayne, Odile Favaron, Wayne Goddard, Paul J. P. Grobler, Christina M. Mynhardt
Changing upper irredundance by edge addition. Discret. Math. 266 (1-3) (2003)
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks. IPDPS (2003)
Wayne Goddard, Stephen T. Hedetniemi, David Pokrass Jacobs, Pradip K. Srimani
A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Grap. IPDPS (2003)
Wayne Goddard, Michael A. Henning
Nordhaus-Gaddum bounds for independent domination. Discret. Math. 268 (1-3) (2003)
Wayne Goddard
4-connected maximal planar graphs are 4-ordered. Discret. Math. 257 (2-3) (2002)
Wayne Goddard, Michael A. Henning
Domination in planar graphs with small diameter. J. Graph Theory 40 (1) (2002)
Wayne Goddard, Michael A. Henning
Vertex Coverings by Coloured Induced Graphs - Frames and Umbrellas. Electron. Notes Discret. Math. 11 (2002)
Mieso K. Denko, Wayne Goddard
Limited flooding protocol for mobile ad hoc networks. South Afr. Comput. J. 29 (2002)
Peter Dankelmann, Wayne Goddard, Ortrud Oellermann, Henda C. Swart
Augmenting trees so that every three vertices lie on a cycle. Discret. Appl. Math. 116 (1-2) (2002)
David P. Day, Wayne Goddard, Michael A. Henning, Henda C. Swart
Multipartite Ramsey Numbers. Ars Comb. 58 (2001)
Peter Dankelmann, Wayne Goddard, Peter J. Slater
Average distance in colored graphs. J. Graph Theory 38 (1) (2001)
Wayne Goddard, Michael A. Henning
Pancyclicity of the prism. Discret. Math. 234 (1-3) (2001)
Wayne Goddard, Michael A. Henning, Ortrud R. Oellermann
Bipartite Ramsey numbers and Zarankiewicz numbers. Discret. Math. 219 (1-3) (2000)
Wayne Goddard, Ortrud Oellermann, Peter J. Slater, Henda C. Swart
Bounds on the Total Redundance and Efficiency of a Graph. Ars Comb. 54 (1999)
Wayne Goddard, Michael A. Henning, Hiren Maharaj
Homogeneous Embeddings of Cycles in Graphs. Graphs Comb. 15 (2) (1999)
Wayne Goddard, Michael A. Henning
Real and integer domination in graphs. Discret. Math. 199 (1-3) (1999)
Peter Dankelmann, Wayne Goddard, Michael A. Henning, Henda C. Swart
Generalized eccentricity, radius, and diameter in graphs. Networks 34 (4) (1999)
Stephan Brandt, Ralph J. Faudree, Wayne Goddard
Weakly pancyclic graphs. J. Graph Theory 27 (3) (1998)
Lenore Cowen, Wayne Goddard, C. Esther Jesurum
Coloring with Defect. SODA (1997)
Roger C. Entringer, Wayne Goddard, Michael A. Henning
A note on cliques and independent sets. J. Graph Theory 24 (1) (1997)
Lenore Cowen, Wayne Goddard, C. Esther Jesurum
Defective coloring revisited. J. Graph Theory 24 (3) (1997)
Wayne Goddard, Michael D. Plummer, Henda C. Swart
Maximum and minimum toughness of graphs of small genus. Discret. Math. (1997)
Lowell W. Beineke, Wayne Goddard, Marc J. Lipman
Graphs with Maximum Edge-Integrity. Ars Comb. 46 (1997)
Ira M. Gessel, Wayne Goddard, Walter Shur, Herbert S. Wilf, Lily Yen
Counting Pairs of Lattice Paths by Intersections. J. Comb. Theory, Ser. A 74 (2) (1996)
Jean E. Dunbar, Wayne Goddard, Stephen T. Hedetniemi, Alice A. McRae, Michael A. Henning
The Algorithmic Complexity of Minus Domination in Graphs. Discret. Appl. Math. 68 (1-2) (1996)
Wayne Goddard
The toughness of cubic graphs. Graphs Comb. 12 (1) (1996)
Wayne Goddard, Henda C. Swart
Distances between graphs under edge operations. Discret. Math. 161 (1-3) (1996)
Wayne Goddard, Meir Katchalski, Daniel J. Kleitman
Forcing Disjoint Segments in the Plane. Eur. J. Comb. 17 (4) (1996)

Wayne Goddard.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Wayne Goddard