Results 31 to 40 of about 15,277,946 (359)
On Shunkov Groups Saturated with Finite Groups
The structure of the group consisting of elements of finite order depends to a large extent on the structure of the finite subgroups of the group under consideration. One of the effective conditions for investigating an infinite group containing elements
A.A. Shlepkin
doaj +1 more source
Finite Groups as Isometry Groups [PDF]
We show that given any finite group G of cardinality k + 1 k + 1 , there is a Riemannian sphere S k − 1 {S^{k - 1}} (imbeddable isometrically as a hypersurface in R
openaire +2 more sources
Quotient Groups of Finite Groups [PDF]
Assume H H and H 0 {H_0} are subgroups of the finite group G G with H 0 ⧋ H H_0 \triangleubar H .
openaire +1 more source
On the Connectivity of Proper Power Graphs of Finite Groups [PDF]
We study the connectivity of proper power graphs of some family of finite groups including nilpotent groups, groups with a nontrivial partition, and symmetric and alternating groups.
Alireza Doostabadi +1 more
semanticscholar +1 more source
Parameters of the coprime graph of a group [PDF]
There are many different graphs one can associate to a group. Some examples are the well-known Cayley graph, the zero divisor graph (of a ring), the power graph, and the recently introduced coprime graph of a group.
Jessie Hamm, Alan Way
doaj +1 more source
Commuting probabilities of finite groups [PDF]
The commuting probability of a finite group is defined to be the probability that two randomly chosen group elements commute. Let P⊂(0,1] be the set of commuting probabilities of all finite groups.
Sean Eberhard
semanticscholar +1 more source
Neutrosophic Graphs of Finite Groups [PDF]
Most of the real world problems in the fields of philosophy, physics, statistics, finance, robotics, design theory, coding theory, knot theory, engineering, and information science contain subtle uncertainty and inconsistent, which causes complexity and
T. Chalapathi, R. V M S S Kiran Kumar
doaj +1 more source
On the structure of finite groups isospectral to finite simple groups [PDF]
Finite groups are said to be isospectral if they have the same sets of element orders. A finite nonabelian simple group L is said to be almost recognizable by spectrum if every finite group isospectral to L is an almost simple group with socle isomorphic
M. A. Grechkoseeva, A. Vasil’ev
semanticscholar +1 more source
A new characterization of Janko simple groups
In this paper, we studied the influence of centralizers on the structure of groups, and demonstrated that Janko simple groups can be uniquely determined by two crucial quantitative properties: its even-order components of the group and the set $ \pi_{p_m}
Zhangjia Han, Jiang Hu , Dongyang He
doaj +1 more source
Subgroup Graphs of Finite Groups
Let G be a fnite group with the set of subgroups of G denoted by S(G), then the subgroup graphs of G denoted by T(G) is a graph which set of vertices is S(G) such that two vertices H, K in S(G) (H not equal to K) are adjacent if either H is a subgroup of
Ojonugwa Ejima +2 more
doaj +1 more source

