624 views

3 Answers

Best answer
1 votes
1 votes

An path is sequence of vertices and edge such that vertex and edge is traversed only once's.

An Euler path is sequence of vertices and edge such that each edge is visited once not all vertex need to be visited.

Just remove word each form Euler path definition you will have definition of path.

selected by
3 votes
3 votes

Eulerian Path is a path in graph that visits every edge exactly once

A Path in a graph is a finite or infinite sequence of edges which connect a sequence of vertices which, by most definitions, are all distinct from one another.

Euler1

An Eulerian cycle, Eulerian circuit or Euler tour in an undirected graph is a cycle that uses each edge exactly once. If such a cycle exists, the graph is called Eulerian or unicursal.

0 votes
0 votes
path is a sequence of vertices and edges such that vertex and edge is traversed only once and Eular path is path which have exactly 2 odd degree virtices

Related questions

4 votes
4 votes
2 answers
1
Jason GATE asked Jan 31, 2017
1,911 views
Which of the following Graph has Euler Path but is not an Euler Graph?A. K1,1 B.K2,10 C.K2,11D.K10,11.