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.

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 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 The Non-Commuting, Non-Generating Graph of a Nilpotent Group

10.37236/9802 ◽  
2021 ◽  
Vol 28 (1) ◽  
Author(s):  
Peter Cameron ◽  
Saul Freedman ◽  
Colva Roney-Dougal
Keyword(s):  
Maximal Subgroup ◽  
Nilpotent Group ◽  
Commuting Graph ◽  
Generating Graph ◽  
Central Elements ◽  
Vertex Set ◽  
Infinite Case ◽  
The Difference ◽  
The Relationship

For a nilpotent group $G$, let $\Xi(G)$ be the difference between the complement of the generating graph of $G$ and the commuting graph of $G$, with vertices corresponding to central elements of $G$ removed. That is, $\Xi(G)$ has vertex set $G \setminus Z(G)$, with two vertices adjacent if and only if they do not commute and do not generate $G$. Additionally, let $\Xi^+(G)$ be the subgraph of $\Xi(G)$ induced by its non-isolated vertices. We show that if $\Xi(G)$ has an edge, then $\Xi^+(G)$ is connected with diameter $2$ or $3$, with $\Xi(G) = \Xi^+(G)$ in the diameter $3$ case. In the infinite case, our results apply more generally, to any group with every maximal subgroup normal. When $G$ is finite, we explore the relationship between the structures of $G$ and $\Xi(G)$ in more detail.

On the generating graphs of symmetric groups

2018 ◽  
Vol 21 (4) ◽  
pp. 629-649 ◽  
Author(s):  
Fuat Erdem
Keyword(s):  
Symmetric Groups ◽  
Alternating Groups

AbstractLet {S_{n}} and {A_{n}} be the symmetric and alternating groups of degree n, respectively. Breuer, Guralnick, Lucchini, Maróti and Nagy proved that the generating graphs {\Gamma(S_{n})} and {\Gamma(A_{n})} are Hamiltonian for sufficiently large n. However, their proof provided no information as to how large n needs to be. We prove that the graphs {\Gamma(S_{n})} and {\Gamma(A_{n})} are Hamiltonian provided that {n\geq 107}.

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.

THE EXISTENCE OR NONEXISTENCE OF NON-COMMUTING GRAPHS WITH PARTICULAR PROPERTIES

2013 ◽  
Vol 13 (01) ◽  
pp. 1350064 ◽  
Author(s):  
M. AKBARI ◽  
A. R. MOGHADDAMFAR
Keyword(s):  
Finite Group ◽  
Abelian Group ◽  
Strongly Regular Graph ◽  
Complete Multipartite Graph ◽  
Commuting Graph ◽  
Central Elements ◽  
Vertex Set ◽  
Strongly Regular ◽  
Multipartite Graph ◽  
Complete Multipartite

We consider the non-commuting graph ∇(G) of a non-abelian finite group G; its vertex set is G\Z(G), the set of non-central elements of G, and two distinct vertices x and y are joined by an edge if [x, y] ≠ 1. We determine the structure of any finite non-abelian group G (up to isomorphism) for which ∇(G) is a complete multipartite graph (see Propositions 3 and 4). It is also shown that a non-commuting graph is a strongly regular graph if and only if it is a complete multipartite graph. Finally, it is proved that there is no non-abelian group whose non-commuting graph is self-complementary and n-cube.

scholarly journals The independence polynomial of inverse commuting graph of dihedral groups

2020 ◽  
Vol 16 (1) ◽  
pp. 115-120
Author(s):  
Aliyu Suleiman ◽  
Aliyu Ibrahim Kiri
Keyword(s):  
Identity Element ◽  
Independent Set ◽  
Independent Sets ◽  
Dihedral Groups ◽  
Independence Polynomial ◽  
Independence Polynomials ◽  
Commuting Graph ◽  
Central Elements ◽  
Vertex Set

Set of vertices not joined by an edge in a graph is called the independent set of the graph. The independence polynomial of a graph is a polynomial whose coefficient is the number of independent sets in the graph. In this research, we introduce and investigate the inverse commuting graph of dihedral groups (D2N) denoted by GIC. It is a graph whose vertex set consists of the non-central elements of the group and for distinct  x,y, E D2N, x and y are adjacent if and only if xy = yx = 1  where 1 is the identity element. The independence polynomials of the inverse commuting graph for dihedral groups are also computed. A formula for obtaining such polynomials without getting the independent sets is also found, which was used to compute for dihedral groups of order 18 up to 32.

scholarly journals On Diameter of Subgraphs of Commuting Graph in Symplectic Group for Elements of Order Three

2021 ◽  
Vol 50 (2) ◽  
pp. 549-557
Author(s):  
Suzila Mohd Kasim ◽  
Athirah Nawawi
Keyword(s):  
Finite Group ◽  
Conjugacy Class ◽  
Symplectic Group ◽  
Undirected Graph ◽  
The Other ◽  
Symplectic Groups ◽  
Main Work ◽  
Commuting Graph ◽  
Mathematical Formulas ◽  
A Finite Group

Suppose G be a finite group and X be a subset of G. The commuting graph, denoted by C(G,X), is a simple undirected graph, where X ⊂G being the set of vertex and two distinct vertices x,y∈X are joined by an edge if and only if xy = yx. The aim of this paper was to describe the structure of disconnected commuting graph by considering a symplectic group and a conjugacy class of elements of order three. The main work was to discover the disc structure and the diameter of the subgraph as well as the suborbits of symplectic groups S4(2)', S4(3) and S6(2). Additionally, two mathematical formulas are derived and proved, one gives the number of subgraphs based on the size of each subgraph and the size of the conjugacy class, whilst the other one gives the size of disc relying on the number and size of suborbits in each disc.

scholarly journals Generators for Alternating and Symmetric Groups

1971 ◽  
Vol 12 (1) ◽  
pp. 63-68 ◽  
Author(s):  
I. M. S. Dey ◽  
James Wiegold
Keyword(s):  
Free Product ◽  
Modular Group ◽  
Symmetric Groups ◽  
Alternating Groups ◽  
Generating Set ◽  
Alternating And Symmetric Groups

Let Γ denote the modular group, that is, the free product of a group of order 2 and a group of order 3. Morris Newman investigates in [2] the factor-groups of Γ and calls them Γ-groups for short; thus a group is a Γ-group if and only if it has a generating set consisting of an element of order dividing 2 and an element of order dividing 3. Newman's interest centres on finite simple Γ-groups. He proves that the linear fractional groups LF(2,p) for primes p are Γ -groups, and poses the problem of deciding which of the alternating groups enjoy this property.

Sign in / Sign up

Export Citation Format

Share Document