Recognition of the groups L₅(4) and U₄(4) by the prime graph

Let G be a finite group. The prime graph of G is the graph Γ(G) whose set of vertices is the set Π(G) of all prime divisors of the order |G| and two different vertices p and q of which are connected by an edge if G has an element of order pq. We prove that if S is one of the simple groups L₅(4) and...

Full description

Saved in:
Bibliographic Details
Published in:Український математичний журнал
Date:2012
Main Authors: Nosratpour, P., Darafsheh, M.R.
Format: Article
Language:English
Published: Інститут математики НАН України 2012
Subjects:
Online Access:https://nasplib.isofts.kiev.ua/handle/123456789/164169
Tags: Add Tag
No Tags, Be the first to tag this record!
Journal Title:Digital Library of Periodicals of National Academy of Sciences of Ukraine
Cite this:Recognition of the groups L₅(4) and U₄(4) by the prime graph / P. Nosratpour, M.R. Darafsheh // Український математичний журнал. — 2012. — Т. 64, № 2. — С. 210-217. — Бібліогр.: 21 назв. — англ.

Institution

Digital Library of Periodicals of National Academy of Sciences of Ukraine