A Simple Proof for the Being Eulerian of the Power Graphs Pi(D) for 3 ≤ i ≤ 6

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

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

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: Mathematics Interdisciplinary Research Year:2024 | Volume:9 | Issue:3 Page(s): 333-347

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

A Simple Proof for the Being Eulerian of the Power Graphs Pi(D) for 3 ≤ i ≤ 6

Author(s)

Mokhtarian Dehkordi Elham | Eshaghi Gordji Madjid | Moradi Sirous | Yarahmadi Zahra | Issue Writer Certificate

Keywords

Directed Euler trail‎

‎Directed Euler tour‎

‎Eulerian digraph‎

‎Directed power graph‎

‎Eulerian power graph

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

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans