2,950 views
1 votes
1 votes
  1. Walk    : Vertices may repeat. Edges may repeat (Closed or Open)
  2. Trail     : Vertices may repeat. Edges cannot repeat (Open)
  3. Circuit : Vertices may repeat. Edges cannot repeat (Closed)
  4. Path     : Vertices cannot repeat. Edges cannot repeat (Open)
  5. Cycle    : Vertices cannot repeat. Edges cannot repeat (Closed)

Can someone verify these terminologies? They are pretty confusing :/

1 Answer

Related questions

0 votes
0 votes
1 answer
1
mb14 asked May 28, 2018
393 views
In this graph it is said that $a,e,b,c,b$ is a path. But according to definition- in a path vertices and edges can't repeat so why this is a path. confused please clarify...
0 votes
0 votes
0 answers
2
0 votes
0 votes
0 answers
3
Pavan Kumar Munnam asked May 12, 2017
374 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,405 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 ...