<?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>Amirkabir University of Technology</PublisherName>
				<JournalTitle>AUT Journal of Mathematics and Computing</JournalTitle>
				<Issn>2783-2449</Issn>
				<Volume></Volume>
				<Issue>Articles in Press</Issue>
				<PubDate PubStatus="epublish">
					<Year>2025</Year>
					<Month>07</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>On the simple $K_5$-groups</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage></FirstPage>
			<LastPage></LastPage>
			<ELocationID EIdType="pii">5781</ELocationID>
			
<ELocationID EIdType="doi">10.22060/ajmc.2025.23312.1249</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Behnam</FirstName>
					<LastName>Ebrahimzadeh</LastName>
<Affiliation>Department of Mathematics, Persian Gulf university, Boshehr, Iran</Affiliation>
<Identifier Source="ORCID">0000-0001-5696-275X</Identifier>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>06</Month>
					<Day>29</Day>
				</PubDate>
			</History>
		<Abstract>After classification  of finite simple groups, the  researchers dissucced about  groups characterization by property. Properties, such as element order, the set of elements with the same order, graphs,etc. In other words  if $G$ be a finite group  and  $M$ be a property  then we say the group $G$ is characterized by property $M$ if by isomorphic $G$ be a only group by property $M$.  One of the methods, is group characterization by largest element order. In other wrds, we say the group $G$ is characterized by largest element order $k(G)$  and order of $G$ if there exists the group $H$, so that  if $k(G)=k(H)$ and $|G|=|H|$, then $G\cong H$.  In this paper, we prove that the simple $K_5$-groups $PSL(6,2)$ and $PSU(6,2)$ can be uniquely determined by their order and the largest order of elements.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">The largest order of elements</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">prime graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Frobenius group</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Projective special linear group</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Projective special unitary group</Param>
			</Object>
		</ObjectList>
</Article>
</ArticleSet>
