On the Enumeration of Certain Classes of Hamiltonian Paths and Cycles in the Complete Graph Defined on the Vertices of a Regular Polygon Samuel Herman Faculty mentor: Eirini Poimenidou New College of Florida We use Burnside’s lemma to enumerate geometric classes of Hamiltonian paths and cycles in the complete graph defined on the vertices of a regular n-gon. Samuel Herman is an undergraduate mathematics student at New College of Florida. His primary interests are in discrete math and algebra.
