Asymptotically Effective Method to Explore Euler Path in a Graph

Muhammad Fahad, Sikandar Ali, Mukhtaj Khan, Mujtaba Husnain, Zeeshan Shafi and Ali Samad

Mathematical Problems in Engineering, 2021, vol. 2021, 1-7

Abstract:

Euler path is one of the most interesting and widely discussed topics in graph theory. An Euler path (or Euler trail) is a path that visits every edge of a graph exactly once. Similarly, an Euler circuit (or Euler cycle) is an Euler trail that starts and ends on the same node of a graph. A graph having Euler path is called Euler graph. While tracing Euler graph, one may halt at arbitrary nodes while some of its edges left unvisited. In this paper, we have proposed some precautionary steps that should be considered in exploring a deadlock-free Euler path, i.e., without being halted at any node. Simulation results show that our proposed approach improves the process of exploring the Euler path in an undirected connected graph without interruption. Furthermore, our proposed algorithm is complete for all types of undirected Eulerian graphs. The paper concludes with the proofs of the correctness of proposed algorithm and its computation complexity.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/8018373.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/8018373.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnlmpe:8018373

DOI: 10.1155/2021/8018373

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().