<?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>13</Volume>
				<Issue>4</Issue>
				<PubDate PubStatus="epublish">
					<Year>2023</Year>
					<Month>09</Month>
					<Day>25</Day>
				</PubDate>
			</Journal>
<ArticleTitle>Group nilpotency from a graph point of view</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>351</FirstPage>
			<LastPage>367</LastPage>
			<ELocationID EIdType="pii">27840</ELocationID>
			
<ELocationID EIdType="doi">10.22108/ijgt.2023.137059.1834</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Valentina</FirstName>
					<LastName>Grazian</LastName>
<Affiliation>Dipartimento di Matematica e Applicazioni, Università di Milano-Bicocca, Milano, Italy</Affiliation>

</Author>
<Author>
					<FirstName>Andrea</FirstName>
					<LastName>Lucchini</LastName>
<Affiliation>Dipartimento di Matematica, Università di Padova, Padova, Italy</Affiliation>

</Author>
<Author>
					<FirstName>Carmine</FirstName>
					<LastName>Monetta</LastName>
<Affiliation>Dipartimento di Matematica, Università di Salerno, Salerno, Italy</Affiliation>
<Identifier Source="ORCID">0000-0002-5426-1260</Identifier>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2023</Year>
					<Month>03</Month>
					<Day>07</Day>
				</PubDate>
			</History>
		<Abstract>Let $\Gamma_G$ denote a graph associated with a group $G$. A compelling question about finite groups asks whether or not a finite group $H$ must be nilpotent provided $\Gamma_H$ is isomorphic to $\Gamma_G$ for a finite nilpotent group $G$. In the present work we analyze the problem for different graphs that one can associate with a finite group, both reporting on existing answers and contributing to new ones.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">graph isomorphism</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">nilpotency</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ijgt.ui.ac.ir/article_27840_ef94323ac4d0a692b7349f5ebe1c7d11.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
