Date Thesis Awarded

5-2018

Document Type

Honors Thesis

Degree Name

Bachelors of Science (BS)

Department

Mathematics

Advisor

Gexin Yu

Committee Members

Junping Shi

Deborah C. Bebout

Abstract

Given a finite symmetric group S_n and a set S of generators, we can represent the group as a Cayley graph. The diameter of the Cayley graph is the largest distance from the identity to any other elements. We work on the conjecture that the diameter of the Cayley graph of a finite symmetric group S_n with S ={(12),(12...n)} is at most $ C(n,2). Our main result is to show that the diameter of the graph of S_n is at most (3n^2-4n)/2.

KIC Document 0001.pdf (409 kB)
Cover Sheet

Available for download on Saturday, May 04, 2019

Share

COinS