- A Note on the Integrity of Trees Wayne Goddard
- Graphs with Two Disjoint Total Dominating Sets Izak Broere, Rand Afrikaans University
- Graphs with Maximum Edge-Integrity Lowell W. Beineke, Indiana-Purdue University at Fort Wayne
- Between Packable and Arbitrarily Packable Graphs: PackerSpoiler Games
- MAD Trees and Distance-Hereditary Graphs E. Dahlhaus,
- A Note on Cliques and Independent Sets Roger C. Entringer
- Generalised Domination and Independence in Graphs Wayne Goddard
- Homogeneous Embeddings of Cycles in Graphs Wayne Goddard
- Clique/Connected/Total Domination Perfect Graphs Wayne Goddard1
- Bounds on the k-Domination Number of a Graph Ermelinda DeLaVi~naa,1
- Broadcast Chromatic Numbers of Graphs Wayne Goddard, Sandra M. Hedetniemi, Stephen T. Hedetniemi
- Acyclic Colorings of Planar Graphs Wayne Goddard,
- The Binding Number of Trees and K(1,3)-free Graphs
- Bipartite Ramsey Numbers and Zarankiewicz Wayne Goddard 1
- An Upper Bound for the Ramsey Numbers r(K3, G) Wayne Goddard1, Daniel J. Kleitman1
- Author Query Form Journal : International Journal of Distributed Sensor Networks
- Domination in Planar Graphs with Small Diameter II Michael Dorfling
- Minimal Claw-Free Graphs P. Dankelmann
- Distances between Graphs under Edge Operations
- Parallel Processing Letters fc World Scientific Publishing Company
- On Domination and Reinforcement Numbers in Trees Jean R. S. Blair
- Distance in Graphs Wayne Goddard1
- More Measures of Vulnerability: Splinter Sets and Directed Toughness
- Convergence of a Transformation on a Weighted Graph Wayne Goddard1, Daniel J. Kleitman1,
- The Integrity of the Cube is Small Lowell W. Beineke1, Wayne Goddard2, Peter Hamburger1,
- Pancyclicity of the Prism Wayne Goddard 1
- Offensive Alliances in Graphs Odile Favaron, Universite Paris-Sud
- The Binding Number of a Graph and its Cliques Jeremy Lyle,a,1
- Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in
- Multiple Vertex Coverings by Cliques Wayne Goddard
- Maximum Sizes of Graphs with Given Domination Parameters
- Integrity in Graphs: Bounds and Basics Wayne Goddard1
- Double Vertex Graphs and Complete Double Vertex Jobby Jacob
- Dense Graphs with Small Clique Number Wayne Goddard1
- On The Graphs with Maximum Distance or k-Diameter Wayne Goddard, Clemson University
- Generalized Subgraph-Restricted Matchings Wayne Goddard a
- Augmenting a Graph of Minimum Degree 2 to have Two Disjoint Total Dominating Sets
- Measures of Vulnerability--The Integrity Family Wayne Goddard
- An Anonymous Self-Stabilizing Algorithm For 1-Maximal Matching in Trees
- Distance and Connectivity Measures in Permutation Graphs
- Construction of Trees and Graphs with Equal Domination Parameters
- A Note on Maximal Triangle-Free Graphs Wayne Goddard, University of Pennsylvania
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- On Distances between Isomorphism Classes of Gerhard Benade, Johannesburg
- Anonymous Self-Stabilizing Distributed Algorithms for Connected Dominating Set in a Network Graph
- The Toughness of Cubic Graphs Wayne Goddard
- Distance-k information in self-stabilizing Wayne Goddard1
- The diameter of total domination vertex critical graphs Wayne Goddard
- Minimum Degree Conditions for Cycles Including Specified Sets of Vertices
- An Algorithm for Outerplanar Graphs with Parameter
- Two Results on the Binding Numbers of Product Graphs
- Some Nordhaus-Gaddum-type Results Wayne Goddard
- The Edge-Integrity of Cartesian Products Lowell W. Beineke, Indiana-Purdue University at Fort Wayne
- Generalised Eccentricity, Radius and Diameter in Graphs Peter Dankelmann, University of Natal, Durban
- Bounds on the Total Redundance and Efficiency of a Graph
- Multipartite Ramsey Numbers David Day, Technikon Natal
- Minimal and Maximal e=1 Functions P. Dankelmann0
- Augmenting Trees so that Every Three Vertices Lie on a Cycle
- Domination in Planar Graphs with Small Diameter Wayne Goddard
- 4-connected Maximal Planar Graphs are 4-ordered Wayne Goddard
- NordhausGaddum Bounds for Independent Wayne Goddard 1
- The Average Eccentricity of a Graph and its Subgraphs
- Hereditary Domination & Independence Parameters Wayne Goddard
- Vertex Coverings by Coloured Induced Graphs--Frames and Umbrellas
- Note: Simultaneous Graph Parameters: Factor Domination and Factor Total Domination
- Orientation Distance Graphs Revisited Wayne Goddard, Kiran Kanakadandi
- Restricted Domination Parameters in Graphs Wayne Goddard and 2
- Emergency Response Sets in Graphs Jean Blair, US Military Academy
- A characterization of cubic graphs with paired-domination number three-fifths their order
- Capacitated Domination Wayne Goddard, Stephen T. Hedetniemi, James L. Huff
- The Graph Distance Game Wayne Goddard
- Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph
- An Anonymous Self-Stabilizing Algorithm for 1-Maximal Independent Set in Trees
- Parallel Processing Letters fc World Scientific Publishing Company
- Average Distance in Coloured Graphs Peter Dankelmann1
- A Note on Steiner-Distance-Hereditary Graphs Wayne Goddard0
- On the Wimer Method for Designing Edge-Based Algorithms
- Eternal Security in Graphs Wayne Goddard, Sandra M. Hedetniemi, Stephen T. Hedetniemi
- Limited Flooding Protocol for Mobile Ad hoc Networks Mieso Denko
- A characterization of cubic graphs with paired-domination number three-fifths their order
- Maximum Sizes of Graphs with Given Domination Parameters
- The diameter of total domination vertex critical graphs Wayne Goddard
- On Domination and Reinforcement Numbers in Trees Jean R. S. Blair
- Double Vertex Graphs and Complete Double Vertex Jobby Jacob
- Anonymous Self-Stabilizing Distributed Algorithms for Connected Dominating Set in a Network Graph
- Construction of Trees and Graphs with Equal Domination Parameters
- An Anonymous Self-Stabilizing Algorithm for 1-Maximal Independent Set in Trees
- Generalised Eccentricity, Radius and Diameter in Graphs Peter Dankelmann, University of Natal, Durban
- Homogeneous Embeddings of Cycles in Graphs Wayne Goddard
- The Toughness of Cubic Graphs Wayne Goddard
- Author Query Form Journal : International Journal of Distributed Sensor Networks
- An Upper Bound for the Ramsey Numbers r(K3, G) Wayne Goddard1, Daniel J. Kleitman1
- MAD Trees and Distance-Hereditary Graphs E. Dahlhaus,
- Augmenting Trees so that Every Three Vertices Lie on a Cycle
- Hereditary Domination & Independence Parameters Wayne Goddard
- NordhausGaddum Bounds for Independent Wayne Goddard 1
- Bounds on the k-Domination Number of a Graph Ermelinda DeLaVi~naa,1
- Distances between Graphs under Edge Operations
- Multipartite Ramsey Numbers David Day, Technikon Natal
- Some Nordhaus-Gaddum-type Results Wayne Goddard
- Graphs with Two Disjoint Total Dominating Sets Izak Broere, Rand Afrikaans University
- Integrity in Graphs: Bounds and Basics Wayne Goddard1
- Acyclic Colorings of Planar Graphs Wayne Goddard,
- Augmenting a Graph of Minimum Degree 2 to have Two Disjoint Total Dominating Sets
- Self-Stabilizing Distributed Algorithm for Strong Matching in a System Graph
- Domination in Planar Graphs with Small Diameter II Michael Dorfling
- A Synchronous Self-Stabilizing Minimal Domination Protocol in an Arbitrary Network Graph
- On The Graphs with Maximum Distance or k-Diameter Wayne Goddard, Clemson University
- Generalized Subgraph-Restricted Matchings Wayne Goddard a
- Convergence of a Transformation on a Weighted Graph Wayne Goddard1, Daniel J. Kleitman1,
- A Note on Steiner-Distance-Hereditary Graphs Wayne Goddard0
- Vertex Coverings by Coloured Induced Graphs--Frames and Umbrellas
- Note: Simultaneous Graph Parameters: Factor Domination and Factor Total Domination
- Capacitated Domination Wayne Goddard, Stephen T. Hedetniemi, James L. Huff
- Self-Stabilizing MasterSlave Token Circulation and Efficient Topology Computation in a Tree of Arbitrary Size
- Self-Stabilizing MasterSlave Token Circulation and Efficient Size-Computation in a Unidirectional Ring of Arbitrary Size
- INDEPENDENT DOMINATING SETS IN TRIANGLE-FREE GRAPHS WAYNE GODDARD AND JEREMY LYLE
- 4-connected Maximal Planar Graphs are 4-ordered Wayne Goddard
- Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in
- Minimal and Maximal e=1 Functions P. Dankelmann0
- The Binding Number of a Graph and its Cliques Jeremy Lyle,a,1
- Parallel Processing Letters fc World Scientific Publishing Company
- Minimal Claw-Free Graphs P. Dankelmann
- Bounds on the Total Redundance and Efficiency of a Graph
- Self-Stabilizing Protocols for Maximal Matching and Maximal Independent Sets for Ad Hoc Networks
- A Robust Distributed Generalized Matching Protocol that Stabilizes in Linear Wayne Goddard, Stephen T. Hedetniemi, David P. Jacobs and Pradip K. Srimani
- Graphs with Maximum Edge-Integrity Lowell W. Beineke, Indiana-Purdue University at Fort Wayne
- The Edge-Integrity of Cartesian Products Lowell W. Beineke, Indiana-Purdue University at Fort Wayne
- Distance and Connectivity Measures in Permutation Graphs
- The Integrity of the Cube is Small Lowell W. Beineke1, Wayne Goddard2, Peter Hamburger1,
- An Anonymous Self-Stabilizing Algorithm For 1-Maximal Matching in Trees
- Orientation Distance Graphs Revisited Wayne Goddard, Kiran Kanakadandi
- Distance-k information in self-stabilizing Wayne Goddard1
- Pancyclicity of the Prism Wayne Goddard 1
- Dense Graphs with Small Clique Number Wayne Goddard1
- Broadcast Chromatic Numbers of Graphs Wayne Goddard, Sandra M. Hedetniemi, Stephen T. Hedetniemi
- Offensive Alliances in Graphs Odile Favaron, Universite Paris-Sud
- Emergency Response Sets in Graphs Jean Blair, US Military Academy
- Clique/Connected/Total Domination Perfect Graphs Wayne Goddard1
- A Self-Stabilizing Distributed Algorithm for Minimal Total Domination in an Arbitrary System Graph
- International Journal of Foundations of Computer Science c World Scientific Publishing Company
- Average Distance in Coloured Graphs Peter Dankelmann1
- Domination in Planar Graphs with Small Diameter Wayne Goddard
- Bipartite Ramsey Numbers and Zarankiewicz Wayne Goddard 1
- More Measures of Vulnerability: Splinter Sets and Directed Toughness
- Parallel Processing Letters fc World Scientific Publishing Company
- The Average Eccentricity of a Graph and its Subgraphs
- Multiple Vertex Coverings by Cliques Wayne Goddard
- A Note on the Integrity of Trees Wayne Goddard
- Parallel Processing Letters fc World Scientific Publishing Company
- Distance-k knowledge in self-stabilizing Wayne Goddard1
- An Algorithm for Outerplanar Graphs with Parameter
- On the Wimer Method for Designing Edge-Based Algorithms
- Restricted Domination Parameters in Graphs Wayne Goddard and 2
- A Note on Maximal Triangle-Free Graphs Wayne Goddard, University of Pennsylvania
- On Distances between Isomorphism Classes of Gerhard Benade, Johannesburg
- A Note on Cliques and Independent Sets Roger C. Entringer
- Two Results on the Binding Numbers of Product Graphs
- Limited Flooding Protocol for Mobile Ad hoc Networks Mieso Denko
- The Binding Number of Trees and K(1,3)-free Graphs
- Eternal Security in Graphs Wayne Goddard, Sandra M. Hedetniemi, Stephen T. Hedetniemi
- The Graph Distance Game Wayne Goddard
- Between Packable and Arbitrarily Packable Graphs: PackerSpoiler Games
- Generalised Domination and Independence in Graphs Wayne Goddard
- Measures of Vulnerability--The Integrity Family Wayne Goddard
- Distance in Graphs Wayne Goddard1
