Asymptotically Effective Method to Explore Euler Path in a Graph. (7th December 2021)

• Record Type: Journal Article
• Authors: Fahad, Muhammad; Ali, Sikandar; Khan, Mukhtaj; Husnain, Mujtaba; Shafi, Zeeshan; Samad, Ali
• Other Names: Jan Naeem Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2021(2021)
• Publication Date: 2021-12-07
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2021/8018373
• Languages: English
• ISSNs: 1024-123X

Abstract

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.