World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
31
Citations
3553
World Ranking
13739
National Ranking
5458

Mathematics

D-Index
31
Citations
3538
World Ranking
3367
National Ranking
1320

Overview

Wayne Goddard is affiliated with Clemson University in the United States and has contributed extensively to the field of Computer Science, with a particular focus on Computational Theory and Mathematics. Their research spans several subfields, including Discrete Mathematics and Combinatorics, Geometry and Topology, Electrical and Electronic Engineering, and Computer Networks and Communications.

Their main topics of work involve advanced graph theory research, graph labeling and dimension problems, complexity and algorithms in graphs, limits and structures in graph theory, graph theory in CDMA systems, graph theory applications, and interconnection networks and systems.

Selected recent publications by Wayne Goddard include:

  • Independent domination, colorings and the fractional idomatic number of a graph (2020, Applied Mathematics and Computation)
  • Domination and dominator colorings in planar graphs with small diameter (2022, Discrete Applied Mathematics)

They have collaborated frequently with a number of researchers in the field. Notable co-authors include Michael A. Henning, Geoffrey Boyer, Anna Bachstein, John Xue, and Kirsti Kuenzel.

Wayne Goddard has published in several prominent venues, particularly:

  • arXiv (Cornell University)
  • Discrete Applied Mathematics
  • Aequationes Mathematicae
  • Applied Mathematics and Computation
  • Mathematica Pannonica

Best Publications

  • Independent domination in graphs: A survey and recent results

    Wayne Goddard;Michael A. Henning

  • Defective coloring revisited

    Lenore Cowen;Wayne Goddard;C. Esther Jesurum

  • A survey of integrity

    K. S. Bagga;L. W. Beineke;W. D. Goddard;M. J. Lipman

  • Vizing's conjecture: a survey and recent results

    Boštjan Brešar;Paul Dorbec;Wayne Goddard;Bert L. Hartnell

  • Distance in Graphs

    Wayne Goddard;Ortrud R. Oellermann

  • Offensive alliances in graphs

    Odile Favaron;Gerd Fricke;Wayne Goddard;Sandra Mitchell Hedetniemi

  • Self-stabilizing protocols for maximal matching and maximal independent sets for ad hoc networks

    W. Goddard;S.T. Hedetniemi;D.P. Jacobs;P.K. Srimani

  • Distance-two information in self-stabilizing algorithms

    Martin Gairing;Wayne Goddard;Stephen T. Hedetniemi;Petter Kristiansen

  • Crossing families

    Boris Aronov;Paul Erdős;Wayne Goddard;Daniel J. Kleitman

  • The agreement metric for labeled binary trees

    Wayne Goddard;Ewa Kubicka;Grzegorz Kubicki;F.R. McMorris

  • The diameter of total domination vertex critical graphs

    Wayne Goddard;Teresa W. Haynes;Michael A. Henning;Lucas C. van der Merwe

  • A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph

    Zhenyu Xu;Stephen T. Hedetniemi;Wayne Goddard;Pradip K. Srimani

  • The s-packing chromatic number of a graph

    Wayne Goddard;Honghai Xu

  • Acyclic colorings of planar graphs

    Wayne Goddard

  • Weakly pancyclic graphs

    Stephan Brandt;Ralph Faudree;Wayne Goddard

  • Construction of trees and graphs with equal domination parameters

    Michael Dorfling;Wayne Goddard;Michael A. Henning;C. M. Mynhardt

  • Domination in planar graphs with small diameter

    Wayne Goddard;Michael A. Henning

  • TOTAL AND PAIRED-DOMINATION NUMBERS OF A TREE

    Mustapha Chellali;Teresa W. Haynes;Wayne Goddard

  • Generalized subgraph-restricted matchings in graphs

    Wayne Goddard;Sandra M. Hedetniemi;Stephen T. Hedetniemi;Renu Laskar

  • Braodcast Chromatic Numbers of Graphs.

    Wayne Goddard;Sandra Mitchell Hedetniemi;Stephen T. Hedetniemi;John M. Harris

  • Domination in planar graphs with small diameter *

    Unknown

  • On the Independent Domination Number of Regular Graphs

    Wayne Goddard;Michael A. Henning;Jeremy Lyle;Justin Southey

Frequent Co-Authors

Michael A. Henning
Michael A. Henning University of Johannesburg
Stephen T. Hedetniemi
Stephen T. Hedetniemi Clemson University
Pradip K. Srimani
Pradip K. Srimani Clemson University
Teresa W. Haynes
Teresa W. Haynes East Tennessee State University
Leonard J. Schulman
Leonard J. Schulman California Institute of Technology
Herbert S. Wilf
Herbert S. Wilf University of Pennsylvania
Sandi Klavžar
Sandi Klavžar University of Ljubljana
Ira M. Gessel
Ira M. Gessel Brandeis University
Gary Chartrand
Gary Chartrand Western Michigan University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing a Mathematics degree in the USA opens up diverse career pathways, often complemented by advanced business and finance studies. Many students explore related fields like business administration or finance through flexible online programs tailored to various professional goals.

For those interested in leadership roles or entrepreneurship, the easiest mba specialization offers an accessible route into management careers without the traditionally demanding entry requirements.

Additionally, professionals seeking convenience and flexibility can find valuable options in the easiest online mba program, allowing further education alongside work commitments.

For those aiming to reach the highest levels of business leadership, exploring online dba programs provides affordable and convenient pathways to a Doctorate in Business Administration, blending analytical skills from math with strategic business insight.

Finally, combining math expertise with financial knowledge through the cheapest online masters in finance programs can lead to rewarding careers in risk management, quantitative analysis, or investment banking.

Best Scientists Citing Wayne Goddard

Trending Scientists