On coprimality graphs for symmetric groups

John Ballantyne, Nicholas Greer, Peter Rowley

Research output: Contribution to journalArticlepeer-review

Abstract

For G a group, X a subset of G and π a set of positive integers we define
a graph Cπ (G, X) whose vertex set is X with x, y ∈ X joined by an edge provided
x = y and the order of xy is in π. Here we investigate Cπ (G, X) when G is a finite
symmetric group and X is a G-conjugacy class of elements of order p, p a prime.
Original languageEnglish
Pages (from-to)1595-1622
Number of pages28
JournalGraphs and Combinatorics
Volume29
Issue number6
DOIs
Publication statusPublished - 31 Oct 2012

Keywords

  • Symmetric group
  • Graph
  • Coprime
  • Order
  • Diameter

Fingerprint

Dive into the research topics of 'On coprimality graphs for symmetric groups'. Together they form a unique fingerprint.

Cite this