Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
cycle_._graph_theory [2014/02/09 03:07] nikolaj |
cycle_._graph_theory [2014/02/09 03:11] nikolaj |
||
|---|---|---|---|
| Line 9: | Line 9: | ||
| | @#DDDDDD: $ u,v\in V $ | | | @#DDDDDD: $ u,v\in V $ | | ||
| - | | @#DDDDDD: $ a$ ... sequence in $V,\ \mathrm{last}(a)=\mathrm{first}(a),\ \forall i.\ a_{i+|V|}=a_i $ | | + | | @#DDDDDD: $ a$ ... sequence in $V,\ \forall i.\ a_{i+|V|}=a_i $ | |
| | @#DDDDDD: $ i\in\mathbb N$ | | | @#DDDDDD: $ i\in\mathbb N$ | | ||
| Line 15: | Line 15: | ||
| ==== Discussion ==== | ==== Discussion ==== | ||
| - | A path is a graph which can fully be described by a sequence of vertices. | + | A path is a graph which can fully be described by a repeating sequence of vertices. |
| ==== Parents ==== | ==== Parents ==== | ||
| === Subset of === | === Subset of === | ||
| - | [[Finite undirected graph]] | + | [[Path . graph theory]], [[Finite undirected graph]] |
