Quasirecognition by prime graph of U_3(q) where 2 < q =p^{alpha} < 100

Quasirecognition by prime graph of U_3(q) where 2 < q =p^{alpha} < 100

Let G be a finite group and let Gamma(G) be the prime graphof G. Assume 2 < q = p^{alpha} < 100 . We determine finite groupsG such that Gamma(G) = Gamma(U_3(q)) and prove that if q neq3, 5, 9, 17, then U_3(q) is quasirecognizable by prime graph,i.e., if G is a finite group with the same prime...

Full description

Bibliographic Details
Main Authors: Ali Iranmanesh, Abolfazl Tehranian, Alireza Khalili Asboei, Seyed Sadegh Salehi Amiri
Format: Article
Language:English
Published: University of Isfahan 2012-09-01
Series:International Journal of Group Theory
Subjects:
Prime graph
element order
simple group
linear group
Online Access:http://www.theoryofgroups.ir/?_action=showPDF&article=1369&_ob=3a2c5d4f00b6ca4392b6fc4dafbcde67&fileName=full_text.pdf

Internet

http://www.theoryofgroups.ir/?_action=showPDF&article=1369&_ob=3a2c5d4f00b6ca4392b6fc4dafbcde67&fileName=full_text.pdf

Similar Items