Use this URL to cite or link to this record in EThOS:
Title: Commuting graphs for elements of order three in finite groups
Author: Nawawi, Athirah Binti
ISNI:       0000 0004 2737 7940
Awarding Body: University of Manchester
Current Institution: University of Manchester
Date of Award: 2013
Availability of Full Text:
Access from EThOS:
Access from Institution:
Let G be a finite group and X a subset of G. The commuting graph C(G,X) is the graph whose vertex set is X with two distinct elements of X joined by an edge whenever they commute in the group G. This thesis studies the structure of commuting graphs C(G,X) when G is either a symmetric group Sym(n) or a sporadic group McL, and X a conjugacy class for elements of order three. We describe how this graph can be useful in understanding various aspects of the structure of the group with a particular emphasis on the connectivity of the graph, the properties of the discs around some fixed vertex and the diameter of the graph.
Supervisor: Walker, Louise; Rowley, Peter Sponsor: Government of Malaysia
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: commuting graph ; elements of order three ; symmetric group ; diameter ; connectivity