2025-02-23T15:08:08-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: Query fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-164169%22&qt=morelikethis&rows=5
2025-02-23T15:08:08-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: => GET http://localhost:8983/solr/biblio/select?fl=%2A&wt=json&json.nl=arrarr&q=id%3A%22irk-123456789-164169%22&qt=morelikethis&rows=5
2025-02-23T15:08:08-05:00 DEBUG: VuFindSearch\Backend\Solr\Connector: <= 200 OK
2025-02-23T15:08:08-05:00 DEBUG: Deserialized SOLR response

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
Main Authors: Nosratpour, P., Darafsheh, M.R.
Format: Article
Language:English
Published: Інститут математики НАН України 2012
Series:Український математичний журнал
Subjects:
Online Access:http://dspace.nbuv.gov.ua/handle/123456789/164169
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 U₄(4) and G is a finite group with Γ(G) = Γ(S), then G has a normal subgroup N such that Π(N) ⊆ {2, 3, 5} and G/N≅S.