<?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>7</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2026</Year>
					<Month>07</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>The undirected power graph on the conjugacy classes of a finite group</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>321</FirstPage>
			<LastPage>324</LastPage>
			<ELocationID EIdType="pii">5679</ELocationID>
			
<ELocationID EIdType="doi">10.22060/ajmc.2025.23715.1293</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Sajjad</FirstName>
					<LastName>Mahmood Robati</LastName>
<Affiliation>Department of Pure Mathematics, Faculty of Science, Imam Khomeini International University, Qazvin, Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2024</Year>
					<Month>11</Month>
					<Day>28</Day>
				</PubDate>
			</History>
		<Abstract>Let $G$ be a finite group. The undirected power graph on the conjugacy classes of $G$ is the simple graph $\mathcal{P_C}(G)$ whose vertices are the conjugacy classes of $G$ and two distinct vertices $C$ and $C&#039;$ are adjacent if one is a subset of a power of the other. In this paper, we show that the graph $\mathcal{P_C}(G)$ is $2$-connected whenever either $|\pi(G)|&gt;1$ or ${\rm Z}(G)$ is cyclic. Moreover, we classify finite groups $G$ whose associated graph $\mathcal{P_C}(G)-\{e\}$ are bipartite.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">conjugacy classes</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">$2$-connected graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">bipartite graph</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">Finite group</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://ajmc.aut.ac.ir/article_5679_166cee72e93a992007a89b39eb29628b.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
