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/08 19:47] nikolaj |
cycle_._graph_theory [2014/03/21 11:11] (current) |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| ===== Cycle . graph theory ===== | ===== Cycle . graph theory ===== | ||
| ==== Set ==== | ==== Set ==== | ||
| - | | @#88DDEE: $V,E$ ... set | | + | | @#55CCEE: context | @#55CCEE: $V,E$ ... set | |
| - | | @#FFBB00: $\langle V,E,\psi\rangle \in \mathrm{it}(E,V) $ | | + | | @#FFBB00: definiendum | @#FFBB00: $\langle V,E,\psi\rangle \in \mathrm{it}(E,V) $ | |
| - | | @#AAFFAA: $\langle V,E,\psi\rangle $ ... path | | + | | @#AAFFAA: inclusion | @#AAFFAA: $ \langle V,E,\psi\rangle $ ... path | |
| + | | @#55EE55: postulate | @#55EE55: $ |V|\ge 3 $ | | ||
| - | | @#DDDDDD: $ u,v\in V $ | | + | | @#DDDDDD: range | @#DDDDDD: $ u,v\in V $ | |
| - | | @#DDDDDD: $ a$ ... sequence in $V,\ \mathrm{last}(a)=\mathrm{first}(a)$ | | + | | @#DDDDDD: range | @#DDDDDD: $ a$ ... sequence in $V,\ \forall i.\ a_{i+|V|}=a_i $ | |
| - | | @#DDDDDD: $ i\in\mathbb N$ | | + | | @#DDDDDD: range | @#DDDDDD: $ i\in\mathbb N$ | |
| - | | @#55EE55: $ \exists a.\ \forall u,v.\ (\exists i.\ \{a_{i},a_{i+1}\}=\{u,v\}) \leftrightarrow (\{u,v\}\dots\mathrm{edge}) $ | | + | | @#55EE55: postulate | @#55EE55: $ \exists a.\ \forall u,v.\ (\exists i.\ \{a_{i},a_{i+1}\}=\{u,v\}) \leftrightarrow (\{u,v\}\dots\mathrm{edge}) $ | |
| ==== 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 === | ||
| [[Path . graph theory]], [[Finite undirected graph]] | [[Path . graph theory]], [[Finite undirected graph]] | ||
| - | === Requirements === | ||
| - | [[Sequence begin]], [[Sequence end]] | ||
