scholarly journals The solubility graph associated with a finite group

2020 ◽  
Vol 30 (08) ◽  
pp. 1555-1564
Author(s):  
B. Akbari ◽  
Mark L. Lewis ◽  
J. Mirzajani ◽  
A. R. Moghaddamfar
Keyword(s):  
Finite Group ◽  
Simple Graph ◽  
Soluble Subgroup ◽  
A Finite Group

The solubility graph associated with a finite group [Formula: see text] is a simple graph whose vertices are the elements of [Formula: see text], and there is an edge between two distinct elements [Formula: see text] and [Formula: see text] if and only if [Formula: see text] is a soluble subgroup of [Formula: see text]. We examine some properties of solubility graphs.

ON THE REGULAR GRAPH RELATED TO THE G-CONJUGACY CLASSES

2021 ◽  
pp. 1-5
Author(s):  
SH. RAHIMI ◽  
Z. AKHLAGHI
Keyword(s):  
Finite Group ◽  
Normal Subgroup ◽  
Conjugacy Class ◽  
Regular Graph ◽  
Simple Graph ◽  
Conjugacy Classes ◽  
A Finite Group

Abstract Given a finite group G with a normal subgroup N, the simple graph $\Gamma _{\textit {G}}( \textit {N} )$ is a graph whose vertices are of the form $|x^G|$ , where $x\in {N\setminus {Z(G)}}$ and $x^G$ is the G-conjugacy class of N containing the element x. Two vertices $|x^G|$ and $|y^G|$ are adjacent if they are not coprime. We prove that, if $\Gamma _G(N)$ is a connected incomplete regular graph, then $N= P \times {A}$ where P is a p-group, for some prime p, $A\leq {Z(G)}$ and $\textbf {Z}(N)\not = N\cap \textbf {Z}(G)$ .

scholarly journals On the minimum degree of the power graph of a finite cyclic group

2020 ◽  
pp. 2150044
Author(s):  
Ramesh Prasad Panda ◽  
Kamal Lochan Patra ◽  
Binod Kumar Sahoo
Keyword(s):  
Finite Group ◽  
Cyclic Group ◽  
Finite Groups ◽  
Minimum Degree ◽  
Simple Graph ◽  
The Other ◽  
Prime Divisors ◽  
Power Graph ◽  
Vertex Set ◽  
A Finite Group

The power graph [Formula: see text] of a finite group [Formula: see text] is the undirected simple graph whose vertex set is [Formula: see text], in which two distinct vertices are adjacent if one of them is an integral power of the other. For an integer [Formula: see text], let [Formula: see text] denote the cyclic group of order [Formula: see text] and let [Formula: see text] be the number of distinct prime divisors of [Formula: see text]. The minimum degree [Formula: see text] of [Formula: see text] is known for [Formula: see text], see [R. P. Panda and K. V. Krishna, On the minimum degree, edge-connectivity and connectivity of power graphs of finite groups, Comm. Algebra 46(7) (2018) 3182–3197]. For [Formula: see text], under certain conditions involving the prime divisors of [Formula: see text], we identify at most [Formula: see text] vertices such that [Formula: see text] is equal to the degree of at least one of these vertices. If [Formula: see text], or that [Formula: see text] is a product of distinct primes, we are able to identify two such vertices without any condition on the prime divisors of [Formula: see text].

Graceful labeling of power graph of group Z2k−1 × Z4

2021 ◽  
pp. 2250121
Author(s):  
Amit Sehgal ◽  
Neeraj Takshak ◽  
Pradeep Maan ◽  
Archana Malik
Keyword(s):  
Finite Group ◽  
Abelian Group ◽  
Finite Abelian Group ◽  
Simple Graph ◽  
Graceful Labeling ◽  
Power Graph ◽  
Vertex Set ◽  
A Finite Group

The power graph of a finite group G is a special type of undirected simple graph whose vertex set is set of elements of G, in which two distinct vertices of G are adjacent if one is the power of other. Let [Formula: see text] be a finite abelian 2-group of order [Formula: see text] where [Formula: see text]. In this paper, we establish that the power graph of finite abelian group G always has graceful labeling without any condition on [Formula: see text].

scholarly journals On normal graph of a finite group

Filomat ◽  
2018 ◽  
Vol 32 (11) ◽  
pp. 4047-4059
Author(s):  
Ali Ashrafi ◽  
Fatemeh Koorepazan-Moftakhar
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Group Structure ◽  
Simple Graph ◽  
Conjugacy Classes ◽  
Open Questions ◽  
A Finite Group ◽  
Proper Normal Subgroup ◽  
Identical Character ◽  
Normal Graph

Suppose G is a finite group and C(G) denotes the set of all conjugacy classes of G. The normal graph of G, N(G), is a finite simple graph such that V(N(G)) = C(G). Two conjugacy classes A and B in C(G) are adjacent if and only if there is a proper normal subgroup N such that A U B ? N. The aim of this paper is to study the normal graph of a finite group G. It is proved, among other things, that the groups with identical character table have isomorphic normal graphs and so this new graph associated to a group has good relationship by its group structure. The normal graphs of some classes of finite groups are also obtained and some open questions are posed.

scholarly journals Finite Groups and Lie Rings with an Automorphism of Order 2n

2016 ◽  
Vol 60 (2) ◽  
pp. 391-412
Author(s):  
E. I. Khukhro ◽  
N. Yu. Makarenko ◽  
P. Shumyatsky
Keyword(s):  
Fixed Point ◽  
Finite Group ◽  
Fixed Points ◽  
Finite Groups ◽  
Derived Length ◽  
Lie Rings ◽  
Soluble Subgroup ◽  
A Finite Group

AbstractSuppose that a finite groupGadmits an automorphismof order 2nsuch that the fixed-point subgroupof the involutionis nilpotent of classc. Letm=) be the number of fixed points of. It is proved thatGhas a characteristic soluble subgroup of derived length bounded in terms ofn,cwhose index is bounded in terms ofm,n,c. A similar result is also proved for Lie rings.

scholarly journals A4-Graph of Finite Simple Groups

2021 ◽  
pp. 289-294
Author(s):  
Ali abd Obaid
Keyword(s):  
Finite Group ◽  
Conjugacy Class ◽  
Simple Graph ◽  
Simple Groups ◽  
Finite Simple Groups ◽  
General Properties ◽  
Vertex Set ◽  
New Type ◽  
A Finite Group

     Let G be a finite group and X be a conjugacy class of order 3 in G. In this paper, we introduce a new type of graphs, namely A4-graph of  G, as a simple graph denoted by A4(G,X) which has X as a vertex set. Two vertices,  x and y, are adjacent if and only if  x≠y and  x y-1=      y x-1. General properties  of the A4-graph as well as the structure of A4(G,X) when G@ 3D4(2) will be studied.

ON HIGHER FROBENIUS–SCHUR INDICATORS

2021 ◽  
pp. 1-11
Author(s):  
YANJUN LIU ◽  
WOLFGANG WILLEMS
Keyword(s):  
Finite Group ◽  
Representation Theory ◽  
Irreducible Characters ◽  
A Finite Group

Abstract Similarly to the Frobenius–Schur indicator of irreducible characters, we consider higher Frobenius–Schur indicators $\nu _{p^n}(\chi ) = |G|^{-1} \sum _{g \in G} \chi (g^{p^n})$ for primes p and $n \in \mathbb {N}$ , where G is a finite group and $\chi $ is a generalised character of G. These invariants give answers to interesting questions in representation theory. In particular, we give several characterisations of groups via higher Frobenius–Schur indicators.

Sign in / Sign up

Export Citation Format

Share Document