Commuting involution graphs for symmetric groups.
type: Item
instance of: scholarly article
title: Commuting involution graphs for symmetric groups.
zbMATH Open document ID: 1034.20003
DOI: 10.1016/S0021-8693(03)00302-8
author: Chris Bates
author: David M. Bundy
author: Sarah B. Perkins
author: Peter J. Rowley
published in: Journal of Algebra
publication date: 2003-08-20T00:00:00Z
review text: Let \(G\) be a finite group and \(X\) be a subset of \(G\). The commuting graph \({\mathcal C}(G,X)\) on the set \(X\) has \(X\) as its vertex set with \(x,y\in X\) joined by an edge whenever \(xy=yx\). If \(X\) consists entirely of involutions, then \({\mathcal C}(G,X)\) is called a commuting involution graph. Many authors have studied \({\mathcal C}(G,X)\) for different choices of \(G\) and \(X\), and from a number of different perspectives. In this paper, the authors analyse the properties of the graph \({\mathcal C}(G,X)\) where \(G\) is the symmetric group \(\text{Sym}(n)\) of degree \(n\) and \(X=a^G\) is an involution conjugacy class of \(G\). This analysis is primarily focused upon the structure and sizes of the sets \(\Delta_i(a)\), the \(i\)-th disc of \(a\) (\(i\in\mathbb{N}\)), connected components of \({\mathcal C}(G,X)\) and, when \({\mathcal C}(G,X)\) is connected, the diameter \(\text{Diam\,}{\mathcal C}(G,X)\) of \({\mathcal C}(G,X)\). We may suppose, without loss of generality, that \(a=(12)(34)\dots(2m-1\,2m)\). It is proved that \({\mathcal C}(G,X)\) is disconnected if and only if \(n=2m+1\) or \(n=4\) and \(m=1\). If \(n=4\) and \(m=1\), then \({\mathcal C}(G,X)\) consists of three connected components each of size 2. If \(n=2m+1\), then \({\mathcal C}(G,X)\) has \(n\) connected components each of which is isomorphic to \({\mathcal C}(H,Y)\) where \(H\cong\text{Sym}(2m)\), \(Y=b^H\), and \(b=(12)(34)\dots(2m-1\,2m)\). Using various results concerning \(\Delta_i(a)\), the authors prove also that if \({\mathcal C}(G,X)\) is connected then either \(\text{Diam\,}{\mathcal C}(G,X)\leq 3\), or \(2m+2\in\{6,8,10\}\) and \(\text{Diam\,}{\mathcal C}(G,X)=4\).
Mathematics Subject Classification ID: 20B30
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 20D60
Mathematics Subject Classification ID: 20E45
zbMATH DE Number: 1967903
zbMATH Keywords: symmetric groups
zbMATH Keywords: commuting involution graphs
zbMATH Keywords: connectedness
zbMATH Keywords: diameters
reviewed by: Anatoli Kondrat'ev
MaRDI profile type: Publication
cites work: Q3128706
cites work: On groups of even order
cites work: Finite groups generated by 3-transpositions. I
cites work: Q4273081
cites work: Q2785567
cites work: Finite quotients of the multiplicative group of a finite dimensional division algebra are solvable
cites work: The commuting graph of minimal nonsolvable groups
cites work: Anisotropic groups of type \(A_n\) and the commuting graph of finite simple groups.
full work available at URL: s0021-8693(03)00302-8
OpenAlex ID: W2011094795
Recommended article: Commuting Involution Graphs in Special Linear Groups
Recommended article: Commuting involution graphs for sporadic simple groups.
Recommended article: Commuting involution graphs for finite Coxeter groups
Recommended article: A note on commuting graphs for symmetric groups
Recommended article: Commuting involution graphs for \(\widetilde A_n\).
Recommended article: The commuting graph of the symmetric inverse semigroup
Recommended article: Commuting involution graphs for certain exceptional groups of Lie type
Recommended article: ON THE COMMUTING GRAPH ASSOCIATED WITH THE SYMMETRIC AND ALTERNATING GROUPS
Recommended article: Commuting involution graphs for
Recommended article: Commuting involution graphs in classical affine Weyl groups
description: scientific article; zbMATH DE number 1967903