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

نویسنده

  • A. Mahmoudifar Department of Mathematics, Tehran North Branch, Islamic Azad University, Tehran, Iran
چکیده مقاله:

The prime graph of a finite group $G$ is denoted by $Gamma(G)$ whose vertex set is $pi(G)$ and two distinct primes $p$ and $q$ are adjacent in $Gamma(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 $Gamma(H)=Gamma(G)$, in while $Hnotcong G$. In this paper, we consider finite groups with the same prime graph as the almost simple group $textrm{PGL}(2,49)$. Moreover, we construct some Frobenius groups whose prime graphs coincide with $Gamma(textrm{PGL}(2,49))$, in particular, we get that $textrm{PGL}(2,49)$ is unrecognizable by its prime graph.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Simple groups with the same prime graph as $D_n(q)$

Vasil'ev posed Problem 16.26 in [The Kourovka Notebook: Unsolved Problems in Group Theory, 16th ed.,Sobolev Inst. Math., Novosibirsk (2006).] as follows:Does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? Conjecture: $k = 5$.In [Zvezdina, On nonabelian simple groups having the same prime graph a...

متن کامل

simple groups with the same prime graph as $d_n(q)$

vasil'ev posed problem 16.26 in [the kourovka notebook: unsolved problems in group theory, 16th ed.,sobolev inst. math., novosibirsk (2006).] as follows:does there exist a positive integer $k$ such that there are no $k$ pairwise nonisomorphicnonabelian finite simple groups with the same graphs of primes? conjecture: $k = 5$.in [zvezdina, on nonabelian simple groups having the same prime gr...

متن کامل

Groups with the Same Prime Graph as an Almost Sporadic Simple Group

Let G be a finite group. We denote by Γ(G) the prime graph of G. Let S be a sporadic simple group. M. Hagie in (Hagie, M. (2003), The prime graph of a sporadic simple group, Comm. Algebra, 31: 44054424) determined finite groups G satisfying Γ(G) = Γ(S). In this paper we determine finite groups G such that Γ(G) = Γ(A) where A is an almost sporadic simple group, except Aut(McL) and Aut(J2).

متن کامل

SIMPLE GROUPS WITH THE SAME PRIME GRAPH AS 2Dn(q)

In 2006, Vasil’ev posed the problem: Does there exist a positive integer k such that there are no k pairwise nonisomorphic nonabelian finite simple groups with the same graphs of primes? Conjecture: k = 5. In 2013, Zvezdina, confirmed the conjecture for the case when one of the groups is alternating. We continue this work and determine all nonabelian simple groups having the same prime graphs a...

متن کامل

ON COMPOSITION FACTORS OF A GROUP WITH THE SAME PRIME GRAPH AS Ln(5)

The prime graph of a finite group $G$ is denoted by$ga(G)$. A nonabelian simple group $G$ is called quasirecognizable by primegraph, if for every finite group $H$, where $ga(H)=ga(G)$, thereexists a nonabelian composition factor of $H$ which is isomorphic to$G$. Until now, it is proved that some finite linear simple groups arequasirecognizable by prime graph, for instance, the linear groups $L_...

متن کامل

Recognition by prime graph of the almost simple group PGL(2, 25)

Throughout this paper, every groups are finite. The prime graph of a group $G$ is denoted by $Gamma(G)$. Also $G$ is called recognizable by prime graph if for every finite group $H$ with $Gamma(H) = Gamma(G)$, we conclude that $Gcong H$. Until now, it is proved that if $k$ is an odd number and $p$ is an odd prime number, then $PGL(2,p^k)$ is recognizable by prime graph. So if $k$ is even, the r...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 06  شماره 03

صفحات  217- 221

تاریخ انتشار 2017-10-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023