On some Frobenius groups with the same prime graph as the almost simple group PGL(2,49)

zbMATH Open1413.20028arXiv1601.00146MaRDI QIDQ4615599FDOQ4615599

Authors: Ali Mahmoudifar 

Publication date: 29 January 2019

Abstract: The prime graph of a finite group $G$ is denoted by $ga(G)$ whose vertex set is $pi(G)$ and two distinct primes $p$ and $q$ are adjacent in $ga(G)$, whenever $G$ contains an element with order $pq$. We say that $G$ is unrecognizable by prime graph if there is a finite group $H$ with $ga(H)=ga(G)$, in while $HotcongG$. In this paper, we consider finite groups with the same prime graph as the almost simple group $extrmPGL(2,49)$. Moreover, we construct some Frobenius groups whose their prime graph coincide with $ga(extrmPGL(2,49))$, in particular, we get that $extrmPGL(2,49)$ is unrecognizable by prime graph.

Full work available at URL: https://arxiv.org/abs/1601.00146

Recommendations

• On the unrecognizability by prime graph for the almost simple group \(\mathrm{PGL}(2,9)\)
• Recognition by prime graph of the almost simple group \(\mathrm{PGL}(2, 25)\)
• On the prime graph of a finite group.
• Characterization by prime graph of \(\text{PGL}(2,p^k)\) where \(p\) and \(k>1\) are odd.
• NCF-distinguishablity by prime graph of \(\text{PGL}(2,p)\) where \(p\) is a prime

zbMATH Keywords

prime graphFrobenius groupalmost simple groupelement order

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Finite Groups in Which Every Element Has Prime Power Order
• Characterization by prime graph of \(\text{PGL}(2,p^k)\) where \(p\) and \(k>1\) are odd.
• PRIME GRAPH COMPONENTS OF FINITE SIMPLE GROUPS
• 2-recognizability by prime graph of \(\text{PSL}(2,p^2)\).
• n-RECOGNITION BY PRIME GRAPH OF THE SIMPLE GROUP PSL(2,q)
• The Prime Graph of a Sporadic Simple Group
• NCF-distinguishablity by prime graph of \(\text{PGL}(2,p)\) where \(p\) is a prime
• On the prime graph of \(\text{PSL}(2,p)\) where \(p>3\) is a prime number.
• Groups with the same order and degree pattern.
• Recognition of the finite almost simple groups PGL2(q) by their spectrum
• Fixed points of large prime-order elements in the equicharacteristic action of linear and unitary groups.
• On element orders in covers of finite simple classical groups.
• On characterization by order and prime graph for alternating groups.
• The number of finite groups whose element orders is given.
• On quasirecognition by prime graph of the simple groups $A^{+}_{n}(p)$ and $A^{-}_{n}(p)$

Cited In (6)

• Title not available (Why is that?)
• Recognition by prime graph of the almost simple group \(\mathrm{PGL}(2, 25)\)
• On the unrecognizability by prime graph for the almost simple group \(\mathrm{PGL}(2,9)\)
• Simple groups with the same prime graph as 2Dn(q)
• On characterization by Gruenberg-Kegel graph of finite simple exceptional groups of Lie type
• On the coincidence of Gruenberg-Kegel graphs of an almost simple group and a nonsolvable Frobenius group

This page was built for publication: On some Frobenius groups with the same prime graph as the almost simple group \(\mathrm{PGL}(2,49)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4615599)