quasirecognition by prime graph of the groups 2d2n(q) where q < 105
Clicks: 70
ID: 200563
2018
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Steady Performance
20.7
/100
70 views
13 readers
AI Quality Assessment
Not analyzed
Readership in this journal
SteadyRanked #44 of 55 articles by views in Turkish journal of pharmaceutical sciences
Most read
Least read
Bar heights use a square-root scale.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Let G be a finite group. The prime graph Γ ( G ) of G is defined as follows: The set of vertices of Γ ( G ) is the set of prime divisors of | G | and two distinct vertices p and p ′ are connected in Γ ( G ) , whenever G contains an element of order p p ′ . A non-abelian simple group P is called recognizable by prime graph if for any finite group G with Γ ( G ) = Γ ( P ) , G has a composition factor isomorphic to P. It is been proved that finite simple groups 2 D n ( q ) , where n ≠ 4 k , are quasirecognizable by prime graph. Now in this paper we discuss the quasirecognizability by prime graph of the simple groups 2 D 2 k ( q ) , where k ≥ 9 and q is a prime power less than 10 5 .
| Reference Key |
moradi2018mathematicsquasirecognition
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | ;Hossein Moradi;Mohammad Reza Darafsheh;Ali Iranmanesh |
| Journal | Turkish journal of pharmaceutical sciences |
| Year | 2018 |
| DOI |
10.3390/math6040057
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.