Can These Sequences Form a Walk, Path, or Circuit in the Digraph?

  • Thread starter Thread starter nicnicman
  • Start date Start date
  • Tags Tags
    Circuit Path
nicnicman
Messages
132
Reaction score
0

Homework Statement


Given the graph, determine if the following sequences form a walk, path and/or a circuit.
http://img843.imageshack.us/img843/5686/digraph.png
1. a, b, c, e
2. b, c, d, d, e, c, f
3. a, b, c, f, g, a
4. b, c, d, e

Homework Equations


The Attempt at a Solution


1. It's not possible for the vertices to form a walk, path, or a circuit in this configuration. There is no relation from c to e.
2. walk
3. walk, circuit
4. walk, path

Are these correct, or am I missing something. Thanks for any suggestions.
 
Last edited by a moderator:
Physics news on Phys.org
nicnicman said:

Homework Statement


Given the graph, determine if the following sequences form a walk, path and/or a circuit.
http://img843.imageshack.us/img843/5686/digraph.png
1. a, b, c, e
2. b, c, d, d, e, c, f
3. a, b, c, f, g, a
4. b, c, d, e


Homework Equations





The Attempt at a Solution


1. It's not possible for the vertices to form a walk, path, or a circuit in this configuration. There is no relation from c to e.
2. walk
3. walk, circuit
4. walk, path

Are these correct, or am I missing something. Thanks for any suggestions.

You should probably give the definitions of 'walk', 'path' and 'circuit' for a directed graph.
 
Last edited by a moderator:
There are two things I don't understand about this problem. First, when finding the nth root of a number, there should in theory be n solutions. However, the formula produces n+1 roots. Here is how. The first root is simply ##\left(r\right)^{\left(\frac{1}{n}\right)}##. Then you multiply this first root by n additional expressions given by the formula, as you go through k=0,1,...n-1. So you end up with n+1 roots, which cannot be correct. Let me illustrate what I mean. For this...
Back
Top