retagged by
406 views

1 Answer

1 votes
1 votes

There is No universally accepted definition of These Terms : Walk, Trail and Path.

So, It depends on How the Author has defined these terms. Every Author first describes/defines these terms and then Builds the concepts around these definitions.

For Example, If you refer Kenneth Rosen (Relation chapter)..He has describes Path as some authors define Walk. 

Hence, There is considerable variation of terminology concerning these concepts.

Some books defined like this :

Walk = Repetition of vertices and edges allowed.
Trail = Repetition of edges NOT allowed.
Path = Repetition of Vertices and Edges NOT allowed.

Other books define Walk as Path (From the above definitions) And Trail as Simple Path etc.

Because of these variations in terminology, you will need to make sure which set of definitions are used in a particular book or article. 


Coming to GATE, If You scan previous GATE questions, They define these terms wherever conflict may occur.

Related questions

0 votes
0 votes
0 answers
2
0 votes
0 votes
0 answers
3
Pavan Kumar Munnam asked May 12, 2017
393 views
algorithm to find more than one path between any two vertices of a graph G=(V,E) , with a complexity of O(VE) ?
3 votes
3 votes
3 answers
4
Vicky rix asked Apr 7, 2017
1,453 views
A graph consists of only one vertex,which is isolated ..Is that graphA) a complete graph ???B) a clique???C) connected graph ???Please explain your answer ...