<?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 Kashan</PublisherName>
				<JournalTitle>Mathematics Interdisciplinary Research</JournalTitle>
				<Issn>2538-3639</Issn>
				<Volume>9</Volume>
				<Issue>3</Issue>
				<PubDate PubStatus="epublish">
					<Year>2024</Year>
					<Month>09</Month>
					<Day>01</Day>
				</PubDate>
			</Journal>
<ArticleTitle>A Simple Proof for the Being Eulerian of the Power Graphs $ P_{i}(D)$ for 3 ≤ i ≤ 6</ArticleTitle>
<VernacularTitle></VernacularTitle>
			<FirstPage>333</FirstPage>
			<LastPage>347</LastPage>
			<ELocationID EIdType="pii">114482</ELocationID>
			
<ELocationID EIdType="doi">10.22052/mir.2024.253450.1432</ELocationID>
			
			<Language>EN</Language>
<AuthorList>
<Author>
					<FirstName>Elham</FirstName>
					<LastName>Mokhtarian Dehkordi</LastName>
<Affiliation>‎Faculty of Mathematics‎, ‎ ‎Statistics and Computer Science‎, ‎‎Semnan University, ‎Semnan‎, ‎I‎. ‎R‎. ‎Iran</Affiliation>

</Author>
<Author>
					<FirstName>Madjid</FirstName>
					<LastName>Eshaghi Gordji</LastName>
<Affiliation>‎Faculty of Mathematics‎, ‎ ‎Statistics and Computer Science‎, ‎‎Semnan University, ‎Semnan‎, ‎I‎. ‎R‎. ‎Iran</Affiliation>

</Author>
<Author>
					<FirstName>Sirous</FirstName>
					<LastName>Moradi</LastName>
<Affiliation>Department of Mathematics,
Faculty of science, Lorestan University, Khorramabad, I. R. Iran</Affiliation>

</Author>
<Author>
					<FirstName>Zahra</FirstName>
					<LastName>Yarahmadi</LastName>
<Affiliation>Department of Mathematics,
Faculty of science, Khorramabad Branch, Islamic Azad University,
Khorramabad, I. R. Iran</Affiliation>

</Author>
</AuthorList>
				<PublicationType>Journal Article</PublicationType>
			<History>
				<PubDate PubStatus="received">
					<Year>2023</Year>
					<Month>08</Month>
					<Day>21</Day>
				</PubDate>
			</History>
		<Abstract>‎In this article‎, ‎we employ a novel and unique method to analyze the Eulerian nature of the power graphs $ P_{i}(D) $ for 3 ⩽ i ⩽ 6‎. ‎Then‎, ‎we will mention some applications of Eulerian power graphs in computer networks‎.</Abstract>
		<ObjectList>
			<Object Type="keyword">
			<Param Name="value">Directed Euler trail‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Directed Euler tour‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Eulerian digraph‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Directed power graph‎</Param>
			</Object>
			<Object Type="keyword">
			<Param Name="value">‎Eulerian power graph</Param>
			</Object>
		</ObjectList>
<ArchiveCopySource DocType="pdf">https://mir.kashanu.ac.ir/article_114482_46d84c55410ce117956de8337a5440f9.pdf</ArchiveCopySource>
</Article>
</ArticleSet>
