<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE ArticleSet PUBLIC "-//NLM//DTD PubMed 2.7//EN" "https://dtd.nlm.nih.gov/ncbi/pubmed/in/PubMed.dtd">
<ArticleSet>
<Article>
<Journal>
				<PublisherName>University of Isfahan</PublisherName>
				<JournalTitle>International Journal of Group Theory</JournalTitle>
				<Issn>2251-7650</Issn>
				<Volume>1</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2012</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Quasirecognition by prime graph of U3(q) where 2 < q = pα < 100</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>51</FirstPage>
			<LastPage>66</LastPage>
			<ELocationID EIdType="pii">1369</ELocationID>
			
<ELocationID EIdType="doi">10.22108/ijgt.2012.1369</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Seyed Sadegh</FirstName>
					<LastName>Salehi Amiri</LastName>
<Affiliation>Islamic Azad University</Affiliation>

</Author>
<Author>
					<FirstName>Alireza</FirstName>
					<LastName>Khalili Asboei</LastName>
<Affiliation>Islamic Azad University</Affiliation>

</Author>
<Author>
					<FirstName>Ali</FirstName>
					<LastName>Iranmanesh</LastName>
<Affiliation>Tarbiat Modares University</Affiliation>

</Author>
<Author>
					<FirstName>Abolfazl</FirstName>
					<LastName>Tehranian</LastName>
<Affiliation>Islamic Azad University</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2012</Year>
					<Month>03</Month>
					<Day>09</Day>
				</PubDate>
			</History>
		<Abstract>Let $G $ be a finite group and let $\Gamma(G)$ be the prime graph‎ ‎of G‎. ‎Assume $2 &lt; q = p^{\alpha} &lt; 100$‎. ‎We determine finite groups‎ ‎G such that $\Gamma(G) = \Gamma(U_3(q))$ and prove that if $q \neq‎ ‎3‎, ‎5‎, ‎9‎, ‎17$‎, ‎then $U_3(q)$ is quasirecognizable by prime graph‎, ‎i.e‎. ‎if $G$ is a finite group with the same prime graph as the‎ ‎finite simple group $U_3(q)$‎, ‎then $G$ has a unique non-Abelian‎ ‎composition factor isomorphic to $U_3(q)$‎. ‎As a consequence of our‎ ‎results‎, ‎we prove that the simple groups $U_{3}(8)$ and $U_{3}(11)$‎ ‎are $4-$recognizable and $2-$recognizable by prime graph‎, ‎respectively‎. ‎In fact‎, ‎the group $U_{3}(8)$ is the first example‎ ‎which is a $4-$recognizable by prime graph‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">prime graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Element order</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">simple group</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">linear group</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijgt.ui.ac.ir/article_1369_3a2c5d4f00b6ca4392b6fc4dafbcde67.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
