Groups with the same prime graph as the simple group Dn(5)

Let G be a finite group. The prime graph of G is denoted by Γ(G). Let G be a finite group such that Γ(G)=Γ(Dn(5)), where n≥6. In the paper, as the main result, we show that if n is odd, then G is recognizable by the prime graph and if n is even, then G is quasirecognizable by the prime graph. Нехай...

Full description

Saved in:
Bibliographic Details
Published in:Український математичний журнал
Date:2014
Main Authors: Babai, A., Khosravi, B.
Format: Article
Language:English
Published: Інститут математики НАН України 2014
Subjects:
Online Access:https://nasplib.isofts.kiev.ua/handle/123456789/166067
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:Groups with the same prime graph as the simple group Dn(5) / A. Babai, B. Khosravi // Український математичний журнал. — 2014. — Т. 66, № 5. — С. 598–608. — Бібліогр.: 33 назв. — англ.

Institution

Digital Library of Periodicals of National Academy of Sciences of Ukraine
Description
Summary:Let G be a finite group. The prime graph of G is denoted by Γ(G). Let G be a finite group such that Γ(G)=Γ(Dn(5)), where n≥6. In the paper, as the main result, we show that if n is odd, then G is recognizable by the prime graph and if n is even, then G is quasirecognizable by the prime graph. Нехай G — скшченна група. Простий граф групи GG позначимо через Γ(G). Нехай G — скінченна група така, що Γ(G)=Γ(Dn(5)), де n≥6. Як основний результат роботи доведено, що для непарних n група G розтзнається простим графом, а для парних n група G є такою, що квазiрозпiзнається простим графом.
ISSN:1027-3190