Skip to main content
Article thumbnail
Location of Repository

A note on commuting graphs for symmetric groups

By C. Bates, D. Bundy, Sarah Hart and P.J. Rowley

Abstract

The commuting graph C(G;X) , where G is a group and X a subset of G, has X as its vertex set with two distinct elements of X joined by an edge when they commute in G. Here the diameter and disc structure of C(G;X) is investigated when G is the symmetric group and X a conjugacy class of\ud G

Topics: ems
Publisher: Electronic Journal of Combinatrics
Year: 2009
OAI identifier: oai:eprints.bbk.ac.uk.oai2:1952

Suggested articles

Citations

  1. Commuting Involution Graphs for Symmetric Groups, doi
  2. Commuting Involution Graphs in Finite Coxeter Groups, doi
  3. Commuting Involution Graphs in Sporadic Simple Groups, doi
  4. The Connectivity of Commuting Graphs, doi
  5. (1997). An Introduction to Algebraic Programming with Magma [draft],

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.