Now showing items 1-1 of 1

    • Applications of Eulerian Path and Tour 

      Sandar Myint; Win Win Mar; Yi Myint (Universities Research Journal (URJ), 2008)
      A path in a graph is an Eulerian path if every edge of the graph appears as an edge in the path exactly once. A closed Eulerian path is an Eulerian tour. A graph is said to be an Eulerian graph if it has an Eulerian tour. ...