So this means that A, B, A, B, A, B, C, B, A is also a closed walk and allowed right?

Thanks,

]]>a closed walk is only when the first and the last letter are the same.

an allowed walk is the one that includes a vertex that is unmarked on your image.

your welcome.

]]>I am just trying to understand the different walks and rules that apply to them...

So this means that A, B, A, B, A, B, C, B, A is also a closed walk?

Thanks,

]]>this is a kind of question i don't encounter very much.where did you get this?

as for the question itself if the route ABCDEBA is considered closed and allowed than so should it be ABCBA.

]]>I am wondering ...

Given the following Graph:

(see image)

A walk is just something like A, B, C, B, E

In a closed walk the "begin" vertex needs to be the same as the "end" vertex.

And we are allowed in that walk to use the vertices that we cross in out walk multiple times...

So a closed walk can be A, B, C, D, E, B, A.

Where "B" is used twice and the start/begin vertex is "A"

Now ... is it correct if I assume if this is a closed walk as well?

A, B, C, B, A

Or is this not allowed?

]]>