A Simple Proof for the Being Eulerian of the Power Graphs $ P_{i}(D)$ for 3 ≤ i ≤ 6

Elham Mokhtarian Dehkordi; Madjid Eshaghi Gordji; Sirous Moradi; Zahra Yarahmadi

doi:10.22052/mir.2024.253450.1432

Mathematics Interdisciplinary Research (Sep 2024)

A Simple Proof for the Being Eulerian of the Power Graphs $ P_{i}(D)$ for 3 ≤ i ≤ 6

Elham Mokhtarian Dehkordi,
Madjid Eshaghi Gordji,
Sirous Moradi,
Zahra Yarahmadi

Affiliations

Elham Mokhtarian Dehkordi: ‎Faculty of Mathematics‎, ‎ ‎Statistics and Computer Science‎, ‎‎Semnan University, ‎Semnan‎, ‎I‎. ‎R‎. ‎Iran
Madjid Eshaghi Gordji: ‎Faculty of Mathematics‎, ‎ ‎Statistics and Computer Science‎, ‎‎Semnan University, ‎Semnan‎, ‎I‎. ‎R‎. ‎Iran
Sirous Moradi: Department of Mathematics, Faculty of science, Lorestan University, Khorramabad, I. R. Iran
Zahra Yarahmadi: Department of Mathematics, Faculty of science, Khorramabad Branch, Islamic Azad University, Khorramabad, I. R. Iran

DOI: https://doi.org/10.22052/mir.2024.253450.1432
Journal volume & issue: Vol. 9, no. 3
pp. 333 – 347

Abstract

Read online

‎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‎.

Published in Mathematics Interdisciplinary Research

ISSN: 2476-4965 (Online)
Publisher: University of Kashan
Country of publisher: Iran, Islamic Republic of
LCC subjects: Science: Mathematics
Website: https://mir.kashanu.ac.ir/

About the journal

Abstract

Keywords