Commuting Involution Graphs for 4-Dimensional Projective Symplectic Groups

Alistaire Everett, Peter Rowley

Research output: Contribution to journalArticlepeer-review


For a group G and X a subset of G the commuting graph of G on X, denoted by C(G,X), is the graph whose vertex set is X with x,y∈X joined by an edge if x≠y and x and y commute. If the elements in X are involutions, then C(G,X) is called a commuting involution graph. This paper studies C(G,X) when G is a 4-dimensional projective symplectic group over a finite field and X a G-conjugacy class of involutions, determining the diameters and structure of the discs of these graphs.
Original languageEnglish
Pages (from-to)959-1000
JournalGraphs and Combinatorics
Issue number4
Publication statusPublished - 4 Jun 2020


Dive into the research topics of 'Commuting Involution Graphs for 4-Dimensional Projective Symplectic Groups'. Together they form a unique fingerprint.

Cite this