Collapsed adjacency diagrams and matrices of commuting graph, 𝒞 (G, X ) for some symmetric groups, Sym(n)

2021 ◽  
Author(s):  
Athirah Nawawi ◽  
Peter J. Rowley
Keyword(s):  
Symmetric Groups ◽  
Commuting Graph

scholarly journals On diameters estimations of the commuting graphs of Sylow $p$-subgroups of the symmetric groups

2013 ◽  
Vol 5 (1) ◽  
pp. 70-78 ◽  
Author(s):  
Yu.Yu. Leshchenko ◽  
L.V. Zoria
Keyword(s):  
Undirected Graph ◽  
Symmetric Groups ◽  
Commuting Graph ◽  
Central Elements

The commuting graph of a group $G$ is an undirected graph whose vertices are non-central elements of $G$ and two distinct vertices $x,y$ are adjacent if and only if $xy=yx$. This article deals with the properties of the commuting graphs of Sylow $p$-subgroups of the symmetric groups. We define conditions of connectedness of respective graphs and give estimations of the diameters if graph is connected.

scholarly journals Commuting Graphs, C(G, X) in Symmetric Groups Sym(n) and Its Connectivity

Symmetry ◽  
2019 ◽  
Vol 11 (9) ◽  
pp. 1178
Author(s):  
Athirah Nawawi ◽  
Sharifah Kartini Said Husain ◽  
Muhammad Rezal Kamel Ariffin
Keyword(s):  
Conjugacy Class ◽  
Symmetric Group ◽  
Symmetric Groups ◽  
Commuting Graph ◽  
Commutativity Property

A commuting graph is a graph denoted by C ( G , X ) where G is any group and X, a subset of a group G, is a set of vertices for C ( G , X ) . Two distinct vertices, x , y ∈ X , will be connected by an edge if the commutativity property is satisfied or x y = y x . This study presents results for the connectivity of C ( G , X ) when G is a symmetric group of degree n, Sym ( n ) , and X is a conjugacy class of elements of order three in G.

ON THE COMMUTING GRAPH ASSOCIATED WITH THE SYMMETRIC AND ALTERNATING GROUPS

2008 ◽  
Vol 07 (01) ◽  
pp. 129-146 ◽  
Author(s):  
A. IRANMANESH ◽  
A. JAFARZADEH
Keyword(s):  
Undirected Graph ◽  
Symmetric Groups ◽  
Alternating Groups ◽  
Commuting Graph ◽  
Central Elements

The commuting graph of a group G, denoted by Γ(G), is a simple undirected graph whose vertices are all non-central elements of G and two distinct vertices x, y are adjacent if xy = yx. The commuting graph of a subset of a group is defined similarly. In this paper we investigate the properties of the commuting graph of the symmetric and alternating and subsets of transpositions and involutions in the symmetric groups.

Constructing Non-Commuting Graph of Symmetric Groups by Using Maple's Software

2018 ◽  
Author(s):  
Nur Idayu Alimon ◽  
Nor Haniza Sarmin ◽  
Ahmad Erfanian
Keyword(s):  
Symmetric Groups ◽  
Commuting Graph

scholarly journals The Topological Indices of the Non-commuting Graph for Symmetric Groups

2020 ◽  
pp. 1-5
Author(s):  
Nur Idayu Alimon ◽  
Nor Haniza Sarmin ◽  
Ahmad Erfanian
Keyword(s):  
Symmetric Group ◽  
Chemical Compound ◽  
Molecular Graph ◽  
Symmetric Groups ◽  
Wiener Index ◽  
Topological Indices ◽  
Zagreb Index ◽  
Commuting Graph ◽  
Central Elements ◽  
Vertex Set

Topological indices are the numerical values that can be calculated from a graph and it is calculated based on the molecular graph of a chemical compound. It is often used in chemistry to analyse the physical properties of the molecule which can be represented as a graph with a set of vertices and edges. Meanwhile, the non-commuting graph is the graph of vertex set whose vertices are non-central elements and two distinct vertices are joined by an edge if they do not commute. The symmetric group, denoted as S_n, is a set of all permutation under composition. In this paper, two of the topological indices, namely the Wiener index and the Zagreb index of the non-commuting graph for symmetric groups of order 6 and 24 are determined. Keywords: Wiener index; Zagreb index; non-commuting graph; symmetric groups

scholarly journals A Note on Commuting Graphs for Symmetric Groups

10.37236/95 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
C. Bates ◽  
D. Bundy ◽  
S. Hart ◽  
P. Rowley
Keyword(s):  
Conjugacy Class ◽  
Symmetric Group ◽  
Symmetric Groups ◽  
Commuting Graph ◽  
Vertex Set

The commuting graph ${\cal 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 ${\cal C}(G,X)$ is investigated when $G$ is the symmetric group and $X$ a conjugacy class of $G$.

scholarly journals On Commuting Graphs for Elements of Order 3 in Symmetric Groups

10.37236/2362 ◽  
2015 ◽  
Vol 22 (1) ◽  
Author(s):  
Athirah Nawawi ◽  
Peter Rowley
Keyword(s):  
Conjugacy Class ◽  
Symmetric Group ◽  
Symmetric Groups ◽  
Commuting Graph ◽  
Vertex Set

The commuting graph $\mathcal{C}(G,X)$, where $G$ is a group and $X$ is a subset of $G$, is the graph with vertex set $X$ and distinct vertices being joined by an edge whenever they commute. Here the diameter of $\mathcal{C}(G,X)$ is studied when $G$ is a symmetric group and $X$ a conjugacy class of elements of order $3$.

scholarly journals Dominant and global dimension of blocks of quantised Schur algebras

2021 ◽  
Author(s):  
Ming Fang ◽  
Wei Hu ◽  
Steffen Koenig
Keyword(s):  
Hecke Algebras ◽  
Symmetric Groups ◽  
Global Dimension ◽  
Group Algebras ◽  
Dominant Dimension ◽  
Schur Algebras ◽  
Homological Dimensions ◽  
Weyl Duality

AbstractGroup algebras of symmetric groups and their Hecke algebras are in Schur-Weyl duality with classical and quantised Schur algebras, respectively. Two homological dimensions, the dominant dimension and the global dimension, of the indecomposable summands (blocks) of these Schur algebras S(n, r) and $$S_q(n,r)$$ S q ( n , r ) with $$n \geqslant r$$ n ⩾ r are determined explicitly, using a result on derived invariance in Fang, Hu and Koenig (J Reine Angew Math 770:59–85, 2021).

Sign in / Sign up

Export Citation Format

Share Document