PHD, Kent State University, 2024, College of Arts and Sciences / Department of Mathematical Sciences
The commuting graph of a group is a graph whose vertices are the noncentral elements of the group, and two vertices are connected in the commuting graph if the elements commute. We first investigate the commuting graph of finite, solvable A-groups, groups whose Sylow subgroups are abelian. We determine when the commuting graph of a solvable A-group will be connected and prove that, when connected, the diameter of the commuting graph will be at most 6. Next, we briefly turn our attention to commuting graphs of p-groups, where p is a prime. We build off work that established there was no universal upper bound on the diameter of the commuting graph by constructing a family of p-groups whose commuting graphs have increasing diameters.
Lastly, we define the cyclic graph of a group to be the graph whose vertices are the nontrivial elements of a group, and two vertices are connected in the cyclic graph if the elements generate a cyclic subgroup. We investigate the cyclic graph of a finite, solvable A-group and establish an upper bound for the diameter. More specifically, if Z(Gi), where Gi is the i-th term in the derived series, we establish that when the deleted enhanced power graph is connected, it will have diameter at most 6+4i. For A-groups of derived length 2, we prove an even stronger bound of 8 for the diameter.
Committee: Mark Lewis (Advisor); Stephen Gagola Jr. (Committee Member); Hamza Balci (Committee Member); Joanne Caniglia (Committee Member); Donald White (Committee Member)
Subjects: Mathematics