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

نویسندگان
Mokhtarian Dehkordi, Elham ID 1
Eshaghi Gordji, Madjid ID 2
Moradi, Sirous ID 3
Yarahmadi, Zahra ID 4

1 ‎Faculty of Mathematics‎, ‎ ‎Statistics and Computer Science‎, ‎‎Semnan University, ‎Semnan‎, ‎I‎. ‎R‎. ‎Iran

2 ‎Faculty of Mathematics‎, ‎ ‎Statistics and Computer Science‎, ‎‎Semnan University, ‎Semnan‎, ‎I‎. ‎R‎. ‎Iran

3 Department of Mathematics, Faculty of science, Lorestan University, Khorramabad, I. R. Iran

4 Department of Mathematics, Faculty of science, Khorramabad Branch, Islamic Azad University, Khorramabad, I. R. Iran

doi
10.22052/mir.2024.253450.1432
چکیده

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

کلیدواژه‌ها
Directed Euler trail‎, ‎Directed Euler tour‎, ‎Eulerian digraph‎, ‎Directed power graph‎, ‎Eulerian power graph