Wayne Goddard

Wayne Goddard is Professor at Clemson University with joint appointments in the School of Computing and School of Mathematical and Statistical Sciences within the College of Science. He specializes in discrete mathematics with research focusing on graph theory, algorithms, and combinatorial optimization.

His research explores fundamental questions in graph theory including domination parameters, isolation numbers, packing problems, and graph toughness. Recent publications examine extremal values of graph invariants, structural properties of regular graphs, and combinatorial optimization techniques.

Goddard has developed educational materials covering algorithms, graph theory, discrete mathematics, and programming. He teaches courses including Data Structures, Algorithms, Linear Algebra, and Graph Theory at both undergraduate and graduate levels.

He is recognized as a Fellow of The Institute of Combinatorics and its Applications, reflecting his contributions to discrete mathematics. His research continues to advance understanding of structural graph properties and combinatorial optimization techniques.