Thread: Question about a "closed walk" in a graph

Hi,

I am wondering ...
Given the following Graph:


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?

Originally Posted by iwan1981

Hi,

I am wondering ...
Given the following Graph:


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?

By your definition of "closed walk" A, B, C, B, A is allowed.

Thanks for the answer ...

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

Thanks,

Originally Posted by iwan1981

Thanks for the answer ...

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

Thanks,

Yes,

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

A, B, A, B, A, B, C, B, A

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

It happens in your walk A, B, A, B, A, B, C, B, A.


So, A, B, A, B, A, B, C, B, A closed walk.

thanks for making this clear for me :-)