scholarly journals On the clique number of Paley graphs of prime power order

2022 ◽  
Vol 77 ◽  
pp. 101930
Author(s):  
Chi Hoi Yip
Keyword(s):  
Prime Power ◽  
Clique Number ◽  
Prime Power Order ◽  
Paley Graphs

scholarly journals A Systematic Approach to Group Properties Using its Geometric Structure

2020 ◽  
Vol 13 (1) ◽  
pp. 84-95
Author(s):  
Muhammed Bello ◽  
Nor Muhainiah Mohd Ali ◽  
Nurfarah Zulkifli
Keyword(s):  
Prime Power ◽  
Prime Graph ◽  
Clique Number ◽  
Prime Power Order ◽  
Dihedral Groups ◽  
Cyclic Groups ◽  
Prime Graphs ◽  
Algebraic Properties ◽  
A Finite Group ◽  
The Relationship

The algebraic properties of a group can be explored through the relationship among its elements. In this paper, we define the graph that establishes a systematic relationship among the group elements. Let G be a finite group, the order product prime graph of a group G, is a graph having the elements of G as its vertices and two vertices are adjacent if and only if the product of their order is a prime power. We give the general presentation for the graph on dihedral groups and cyclic groups and classify finite dihedral groups and cyclic groups in terms of the order product prime graphs as one of connected, complete, regular and planar. We also obtained some invariants of the graph such as its diameter, girth,independent number and the clique number. Furthermore, we used thevertex-cut of the graph in determining the nilpotency status of dihedralgroups. The graph on dihedral groups is proven to be regular and complete only if the degree of the corresponding group is even prime power and connected for all prime power degree. It is also proven on cyclic groups to be both regular, complete and connected if the group has prime power order. Additionally, the result turn out to show that any dihedral group whose order product prime graph’s vertex-cut is greater than one is nilpotent. We also show that the order product prime graph is planar only when the degree of the group is three for dihedral groups and less than five for cyclic groups. Our final result shows that the order product prime graphs of any two isomorphic groups are isomophic.

scholarly journals A Systematic Approach to Group Properties Using its Geometric Structure

2020 ◽  
Vol 13 (1) ◽  
pp. 84-95
Author(s):  
Muhammed Bello ◽  
Nor Muhainiah Mohd Ali ◽  
Nurfarah Zulkifli
Keyword(s):  
Prime Power ◽  
Prime Graph ◽  
Clique Number ◽  
Prime Power Order ◽  
Dihedral Groups ◽  
Cyclic Groups ◽  
Prime Graphs ◽  
Algebraic Properties ◽  
A Finite Group ◽  
The Relationship

The algebraic properties of a group can be explored through the relationship among its elements. In this paper, we define the graph that establishes a systematic relationship among the group elements. Let G be a finite group, the order product prime graph of a group G, is a graph having the elements of G as its vertices and two vertices are adjacent if and only if the product of their order is a prime power. We give the general presentation for the graph on dihedral groups and cyclic groups and classify finite dihedral groups and cyclic groups in terms of the order product prime graphs as one of connected, complete, regular and planar. We also obtained some invariants of the graph such as its diameter, girth,independent number and the clique number. Furthermore, we used thevertex-cut of the graph in determining the nilpotency status of dihedralgroups. The graph on dihedral groups is proven to be regular and complete only if the degree of the corresponding group is even prime power and connected for all prime power degree. It is also proven on cyclic groups to be both regular, complete and connected if the group has prime power order. Additionally, the result turn out to show that any dihedral group whose order product prime graph’s vertex-cut is greater than one is nilpotent. We also show that the order product prime graph is planar only when the degree of the group is three for dihedral groups and less than five for cyclic groups. Our final result shows that the order product prime graphs of any two isomorphic groups are isomophic.

scholarly journals The energy of integral circulant graphs with prime power order

2011 ◽  
Vol 5 (1) ◽  
pp. 22-36 ◽  
Author(s):  
J.W. Sander ◽  
T. Sander
Keyword(s):  
Adjacency Matrix ◽  
Prime Power ◽  
Prime Power Order ◽  
Circulant Graph ◽  
Closed Formula ◽  
Circulant Graphs ◽  
Vertex Set

The energy of a graph is the sum of the moduli of the eigenvalues of its adjacency matrix. We study the energy of integral circulant graphs, also called gcd graphs. Such a graph can be characterized by its vertex count n and a set D of divisors of n such that its vertex set is Zn and its edge set is {{a,b} : a, b ? Zn; gcd(a-b, n)? D}. For an integral circulant graph on ps vertices, where p is a prime, we derive a closed formula for its energy in terms of n and D. Moreover, we study minimal and maximal energies for fixed ps and varying divisor sets D.

Space groups and groups of prime-power order II

1980 ◽  
Vol 35 (1) ◽  
pp. 203-209 ◽  
Author(s):  
H. Finken ◽  
J. Neub�ser ◽  
W. Plesken
Keyword(s):  
Prime Power ◽  
Prime Power Order ◽  
Space Groups

On S-Quasinormal and C-Normal Subgroups of Prime Power Order in Finite Groups

2011 ◽  
Vol 18 (04) ◽  
pp. 685-692
Author(s):  
Xuanli He ◽  
Shirong Li ◽  
Xiaochun Liu
Keyword(s):  
Finite Group ◽  
Finite Groups ◽  
Prime Power ◽  
Maximal Subgroups ◽  
Prime Power Order ◽  
Normal Subgroups ◽  
A Finite Group

Let G be a finite group, p the smallest prime dividing the order of G, and P a Sylow p-subgroup of G with the smallest generator number d. Consider a set [Formula: see text] of maximal subgroups of P such that [Formula: see text]. It is shown that if every member [Formula: see text] of is either S-quasinormally embedded or C-normal in G, then G is p-nilpotent. As its applications, some further results are obtained.

scholarly journals Finite groups with certain subgroups of prime power order complemented

2015 ◽  
Vol 423 ◽  
pp. 950-962 ◽  
Author(s):  
Guohua Qian ◽  
Feng Tang
Keyword(s):  
Finite Groups ◽  
Prime Power ◽  
Prime Power Order

scholarly journals Automorphism orbits of finite groups

1986 ◽  
Vol 40 (2) ◽  
pp. 253-260 ◽  
Author(s):  
Thomas J. Laffey ◽  
Desmond MacHale
Keyword(s):  
Finite Group ◽  
Automorphism Group ◽  
Finite Groups ◽  
Prime Power ◽  
Structure Theorem ◽  
Equivalence Classes ◽  
Prime Power Order ◽  
A Finite Group

AbstractLet G be a finite group and let Aut(G) be its automorphism group. Then G is called a k-orbit group if G has k orbits (equivalence classes) under the action of Aut(G). (For g, hG, we have g ~ h if ga = h for some Aut(G).) It is shown that if G is a k-orbit group, then kGp + 1, where p is the least prime dividing the order of G. The 3-orbit groups which are not of prime-power order are classified. It is shown that A5 is the only insoluble 4-orbit group, and a structure theorem is proved about soluble 4-orbit groups.

scholarly journals On c-normality of finite groups

2005 ◽  
Vol 78 (3) ◽  
pp. 297-304 ◽  
Author(s):  
M. Asaad ◽  
M. Ezzat Mohamed
Keyword(s):  
Normal Subgroup ◽  
Finite Groups ◽  
Prime Power ◽  
Prime Power Order

AbstractA subgroup H of a finite G is said to be c-normal in G if there exists a normal subgroup N of G such that G = HN with H ∩ N ≤ HG = CoreG(H). We are interested in studying the influence of the c–normality of certain subgroups of prime power order on the structure of finite groups.

The Laitinen Conjecture for finite non-solvable groups

2012 ◽  
Vol 56 (1) ◽  
pp. 303-336 ◽  
Author(s):  
Krzysztof Pawałowski ◽  
Toshio Sumi
Keyword(s):  
Finite Group ◽  
Fixed Points ◽  
Solvable Group ◽  
Prime Power ◽  
Solvable Groups ◽  
Conjugacy Classes ◽  
Prime Power Order ◽  
Algebraic Condition ◽  
Smooth Action

AbstractFor any finite group G, we impose an algebraic condition, the Gnil-coset condition, and prove that any finite Oliver group G satisfying the Gnil-coset condition has a smooth action on some sphere with isolated fixed points at which the tangent G-modules are not isomorphic to each other. Moreover, we prove that, for any finite non-solvable group G not isomorphic to Aut(A6) or PΣL(2, 27), the Gnil-coset condition holds if and only if rG ≥ 2, where rG is the number of real conjugacy classes of elements of G not of prime power order. As a conclusion, the Laitinen Conjecture holds for any finite non-solvable group not isomorphic to Aut(A6).

Sign in / Sign up

Export Citation Format

Share Document