scholarly journals The Energy of Conjugacy Classes Graphs of Some Order of Alternating Groups

2020 ◽  
Vol 7 (4) ◽  
pp. 62-71
Author(s):  
Zuzan Naaman Hassan ◽  
Nihad Titan Sarhan
Keyword(s):  
Conjugacy Class ◽  
Adjacency Matrix ◽  
Finite Graph ◽  
Conjugacy Classes ◽  
Alternating Group ◽  
Alternating Groups ◽  
Eigen Values ◽  
Finite Set ◽  
Class Graph ◽  
Square Matrix

The energy of a graph , is the sum of all absolute values of the eigen values of the adjacency matrix which is indicated by . An adjacency matrix is a square matrix used to represent of finite graph where the rows and columns consist of 0 or 1-entry depending on the adjacency of the vertices of the graph. The group of even permutations of a finite set is known as an alternating group  . The conjugacy class graph is a graph whose vertices are non-central conjugacy classes of a group , where two vertices are connected if their cardinalities are not coprime. In this paper, the conjugacy class of alternating group  of some order for   and their energy are computed. The Maple2019 software and Groups, Algorithms, and Programming (GAP) are assisted for computations.

THE CONJUGACY CLASSES OF SOME FINITE METABELIAN GROUPS AND THEIR RELATED GRAPHS

2016 ◽  
Vol 79 (1) ◽  
Author(s):  
Nor Haniza Sarmin ◽  
Ain Asyikin Ibrahim ◽  
Alia Husna Mohd Noor ◽  
Sanaa Mohamed Saleh Omer
Keyword(s):  
Graph Theory ◽  
Conjugacy Class ◽  
Dihedral Group ◽  
Clique Number ◽  
Conjugacy Classes ◽  
Quaternion Group ◽  
Metabelian Groups ◽  
Dominating Number ◽  
Graph Properties ◽  
Class Graph

In this paper, the conjugacy classes of three metabelian groups, namely the Quasi-dihedral group, Dihedral group and Quaternion group of order 16 are computed. The obtained results are then applied to graph theory, more precisely to conjugate graph and conjugacy class graph. Some graph properties such as chromatic number, clique number, dominating number and independent number are found.   

scholarly journals The conjugacy class graph of some finite groups and its energy

2017 ◽  
Vol 13 (4) ◽  
pp. 659-665 ◽  
Author(s):  
Rabiha Mahmoud ◽  
Nor Haniza Sarmin ◽  
Ahmad Erfanian
Keyword(s):  
Conjugacy Class ◽  
General Formula ◽  
Finite Groups ◽  
Adjacency Matrix ◽  
Dihedral Group ◽  
Dihedral Groups ◽  
The Absolute ◽  
Generalized Quaternion ◽  
Class Graph

The energy of a graph which is denoted by  is defined to be the sum of the absolute values of the eigenvalues of its adjacency matrix. In this paper we present the concepts of conjugacy class graph of dihedral groups and introduce the general formula for the energy of the conjugacy class graph of dihedral groups. The energy of any dihedral group of order   in different cases, depends on the parity of   is proved in this paper. Also we introduce the general formula for the conjugacy class graph of generalized quaternion groups and quasidihedral groups.

scholarly journals General Form of Domination Polynomial for Two Types of Graphs Associated to Dihedral Groups

MATEMATIKA ◽  
2019 ◽  
Vol 35 (2) ◽  
pp. 149-155
Author(s):  
Nabilah Najmuddin ◽  
Nor Haniza Sarmin ◽  
Ahmad Erfanian
Keyword(s):  
Conjugacy Class ◽  
Finite Groups ◽  
Conjugacy Classes ◽  
Complete Graphs ◽  
Dominating Sets ◽  
Dihedral Groups ◽  
Graph Polynomial ◽  
Central Elements ◽  
Domination Polynomial ◽  
Class Graph

A domination polynomial is a type of graph polynomial in which its coefficients represent the number of dominating sets in the graph. There are many researches being done on the domination polynomial of some common types of graphs but not yet for graphs associated to finite groups. Two types of graphs associated to finite groups are the conjugate graph and the conjugacy class graph. A graph of a group G is called a conjugate graph if the vertices are non-central elements of G and two distinct vertices are adjacent if they are conjugate to each other. Meanwhile, a conjugacy class graph of a group G is a graph in which its vertices are the non-central conjugacy classes of G and two distinct vertices are connected if and only if their class cardinalities are not coprime. The conjugate and conjugacy class graph of dihedral groups can be expressed generally as a union of complete graphs on some vertices. In this paper, the domination polynomials are computed for the conjugate and conjugacy class graphs of the dihedral groups.

scholarly journals The conjugacy class graphs of non-abelian 3-groups

2020 ◽  
Vol 16 (3) ◽  
pp. 297-299
Author(s):  
Athirah Zulkarnain ◽  
Nor Haniza Sarmin ◽  
Hazzirah Izzati Mat Hassim
Keyword(s):  
Conjugacy Class ◽  
Chromatic Number ◽  
Simple Graph ◽  
Conjugacy Classes ◽  
Prime Power Order ◽  
Complete Graphs ◽  
Dominating Number ◽  
Minimum Number ◽  
Vertex Set ◽  
Class Graph

A graph is formed by a pair of vertices and edges. It can be related to groups by using the groups’ properties for its vertices and edges. The set of vertices of the graph comprises the elements or sets from the group while the set of edges of the graph is the properties and condition for the graph. A conjugacy class of an element  is the set of elements that are conjugated with . Any element of a group , labelled as , is conjugated to  if it satisfies  for some elements  in  with its inverse . A conjugacy class graph of a group   is defined when its vertex set is the set of non-central conjugacy classes of  . Two distinct vertices   and   are connected by an edge if and only if their cardinalities are not co-prime, which means that the order of the conjugacy classes of  and  have common factors. Meanwhile, a simple graph is the graph that contains no loop and no multiple edges. A complete graph is a simple graph in which every pair of distinct vertices is adjacent. Moreover, a  -group is the group with prime power order. In this paper, the conjugacy class graphs for some non-abelian 3-groups are determined by using the group’s presentations and the definition of conjugacy class graph. There are two classifications of the non-abelian 3-groups which are used in this research. In addition, some properties of the conjugacy class graph such as the chromatic number, the dominating number, and the diameter are computed. A chromatic number is the minimum number of vertices that have the same colours where the adjacent vertices have distinct colours. Besides, a dominating number is the minimum number of vertices that is required to connect all the vertices while a diameter is the longest path between any two vertices. As a result of this research, the conjugacy class graphs of these groups are found to be complete graphs with chromatic number, dominating number and diameter that are equal to eight, one and one, respectively.

scholarly journals The independence and clique polynomial of the conjugacy class graph of dihedral group

2018 ◽  
Vol 14 ◽  
pp. 434-438
Author(s):  
Nabilah Najmuddin ◽  
Nor Haniza Sarmin ◽  
Ahmad Erfanian ◽  
Hamisan Rahmat
Keyword(s):  
Conjugacy Class ◽  
Complete Graph ◽  
Dihedral Group ◽  
Independent Set ◽  
Independent Sets ◽  
Conjugacy Classes ◽  
Dihedral Groups ◽  
Independence Polynomial ◽  
Independence Polynomials ◽  
Class Graph

The independence and clique polynomial are two types of graph polynomial that store combinatorial information of a graph. The independence polynomial of a graph is the polynomial in which its coefficients are the number of independent sets in the graph. The independent set of a graph is a set of vertices that are not adjacent. The clique polynomial of a graph is the polynomial in which its coefficients are the number of cliques in the graph. The clique of a graph is a set of vertices that are adjacent. Meanwhile, a graph of group G is called conjugacy class graph if the vertices are non-central conjugacy classes of G and two distinct vertices are connected if and only if their class cardinalities are not coprime. The independence and clique polynomial of the conjugacy class graph of a group G can be obtained by considering the polynomials of complete graph or polynomials of union of some graphs. In this research, the independence and clique polynomials of the conjugacy class graph of dihedral groups of order 2n are determined based on three cases namely when n is odd, when n and n/2 are even, and when n is even and n/2 is odd. For each case, the results of the independence polynomials are of degree two, one and two, and the results of the clique polynomials are of degree (n-1)/2, (n+2)/2 and (n-2)/2, respectively.

scholarly journals Product of Conjugacy Classes of the Alternating Group An

2012 ◽  
Vol 9 (3) ◽  
pp. 565-568
Author(s):  
Baghdad Science Journal
Keyword(s):  
Positive Integer ◽  
Conjugacy Class ◽  
Symmetric Group ◽  
Nonempty Subset ◽  
Conjugacy Classes ◽  
Alternating Group ◽  
Class C

For a nonempty subset X of a group G and a positive integer m , the product of X , denoted by Xm ,is the set Xm = That is , Xm is the subset of G formed by considering all possible ordered products of m elements form X. In the symmetric group Sn, the class Cn (n odd positive integer) split into two conjugacy classes in An denoted Cn+ and Cn- . C+ and C- were used for these two parts of Cn. This work we prove that for some odd n ,the class C of 5- cycle in Sn has the property that = An n 7 and C+ has the property that each element of C+ is conjugate to its inverse, the square of each element of it is the element of C-, these results were used to prove that C+ C- = An exceptional of I (I the identity conjugacy class), when n=5+4k , k>=0.

scholarly journals NORMAL SUBGROUPS WHOSE CONJUGACY CLASS GRAPH HAS DIAMETER THREE

2016 ◽  
Vol 94 (2) ◽  
pp. 266-272
Author(s):  
ANTONIO BELTRÁN ◽  
MARÍA JOSÉ FELIPE ◽  
CARMEN MELCHOR
Keyword(s):  
Finite Group ◽  
Normal Subgroup ◽  
Conjugacy Class ◽  
Conjugacy Classes ◽  
Normal Subgroups ◽  
A Finite Group ◽  
Class Graph

Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We determine the structure of $N$ when the diameter of the graph associated to the $G$-conjugacy classes contained in $N$ is as large as possible, that is, equal to three.

Conjugacy classes of double covers of monomial groups

1984 ◽  
Vol 96 (2) ◽  
pp. 195-201 ◽  
Author(s):  
John F. Humphreys
Keyword(s):  
Finite Group ◽  
Conjugacy Class ◽  
Symmetric Group ◽  
Double Cover ◽  
Conjugacy Classes ◽  
Alternating Group ◽  
Double Covers ◽  
Monomial Group ◽  
The Subject ◽  
A Finite Group

Let G be a finite group, Sn be the symmetric group on n symbols and An be the corresponding alternating group. The conjugacy classes of the wreath product GSn (or monomial group as it is sometimes known) and the conjugacy classes of GAn have been described by Kerber (see [2] and [3]). The group Sn has a double cover n so that the faithful complex representations of this double cover may be regarded as protective representations of Sn. In Section 2, a particular double cover for GSn is constructed, the faithful complex representations of this group being the subject of a joint article with Peter Hoffman[1]. In the present paper, our task is to determine whether a conjugacy class of GSn corresponds to one or to two conjugacy classes in the double cover of GSn (and similarly for GAn). The main results, Theorems 1 and 2, are stated precisely in Section 2 and proved in Sections 3 and 4 respectively. The case when G = 1 provides classical results of Schur ([5], Satz IV). When G is a cyclic group, Read [4] has determined the conjugacy classes, not just for our particular double cover, but for all possible double covers of GSn.

ON GRAPHS ASSOCIATED TO CONJUGACY CLASSES OF SOME THREE-GENERATOR GROUPS

2016 ◽  
Vol 79 (1) ◽  
Author(s):  
Nor Haniza Sarmin ◽  
Alia Husna Mohd Noor ◽  
Sanaa Mohamed Saleh Omer
Keyword(s):  
Conjugacy Class ◽  
Chromatic Number ◽  
Clique Number ◽  
Conjugacy Classes ◽  
Line Segments ◽  
Dominating Number ◽  
Commuting Graph ◽  
Independent Number ◽  
Graph Properties ◽  
Class Graph

A graph consists of points which are called vertices, and connections which are called edges, which are indicated by line segments or curves joining certain pairs of vertices.  In this paper, four types of graphs which are the commuting graph, non-commuting graph conjugate graph and the conjugacy class graph for some three-generator groups are discussed. Some of the graph properties are also found which include the independent number, chromatic number, clique number and dominating number.

scholarly journals Covering Theorems for FINASIGS VIII—almost all conjugacy classes in An have exponent ≤4

1978 ◽  
Vol 25 (2) ◽  
pp. 210-214 ◽  
Author(s):  
J. L. Brenner
Keyword(s):  
Conjugacy Class ◽  
Conjugacy Classes ◽  
The Other ◽  
Alternating Group ◽  
Other Hand ◽  
Covering Theorems ◽  
Image Position ◽  
Almost All

AbstractThe product of two subsets C, D of a group is defined as . The power Ce is defined inductively by C0 = {1}, Ce = CCe−1 = Ce−1C. It is known that in the alternating group An, n > 4, there is a conjugacy class C such that CC covers An. On the other hand, there is a conjugacy class D such that not only DD≠An, but even De≠An for e<[n/2]. It may be conjectured that as n ← ∞, almost all classes C satisfy C3 = An. In this article, it is shown that as n ← ∞, almost all classes C satisfy C4 = An.

Sign in / Sign up

Export Citation Format

Share Document