On some Frobenius groups with the same prime graph as the almost simple group PGL(2,49)
Abstract
The prime graph of a finite group G is denoted by (G) whose vertex set is π(G) and two distinct primes p and q are adjacent in (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 (H)=(G), in while H G. In this paper, we consider finite groups with the same prime graph as the almost simple group PGL(2,49). Moreover, we construct some Frobenius groups whose their prime graph coincide with (PGL(2,49)), in particular, we get that PGL(2,49) is unrecognizable by prime graph.
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.