Wayne Goddard
About
Wayne Goddard is a Professor with a joint appointment in the School of Computing and the School of Mathematical and Statistical Sciences at Clemson University. He is a highly versatile scholar with two PhDs—one in Mathematics from the University of Natal and another in Applied Mathematics from MIT. Dr. Goddard’s research primarily explores the intersection of graph theory and discrete mathematics, with specific focuses on graph algorithms, domination parameters, and distance in graphs. He is the author of several foundational textbooks, including Introducing the Theory of Computation, and serves as an editor for the Handbook of Discrete and Combinatorial Mathematics. Beyond his theoretical research, he is recognized for his leadership as the Chair of the Faculty of Instruction in the School of Computing and for his dedication to teaching, frequently leading courses in data structures, algorithms, and the theory of computation.
Research Performance Summary
First Recorded Paper
All graphs on a non-prime number of vertices are destructible
Year: 1985
Citations: 4
Venue: Quaestiones Mathematicae 8 (4)
Latest Recorded Paper
Article in volume
Year: 2025
Citations: 0
Venue: Discussiones Mathematicae Graph Theory 45 (1)
Last 10 Years Publication Activity
This timeline shows the professor's yearly publication activity.