Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
finite_undirected_graph [2014/02/10 23:09] nikolaj |
finite_undirected_graph [2014/02/10 23:11] nikolaj created |
||
|---|---|---|---|
| Line 1: | Line 1: | ||
| - | ===== Hypercube graph ===== | + | x |
| - | ==== Set ==== | + | |
| - | | @#88DDEE: $ n\in\mathbb N, n\ge 1 $ | | + | |
| - | | @#DDDDDD: $ V\equiv \{0,1\}^n $ | | + | |
| - | | @#FFBB00: $Q_n\equiv \langle V,E\rangle$ | | ||
| - | |||
| - | | @#DDDDDD: $ k\in\mathbb N,1\le k\le n $ | | ||
| - | | @#FFFDDD: $ v,w\in V $ | | ||
| - | |||
| - | | @#55EE55: $ \{v,w\}\in E\leftrightarrow \exists!k.\ \pi_k(v)\neq\pi_k(w) $ | | ||
| - | |||
| - | ==== Discussion ==== | ||
| - | The Hypercube graph, also called n-cube, has vertices all n-tuples of 0's and 1's and two such vertices are connected iff they differ in one coordinate. | ||
| - | |||
| - | E.g. $V(Q_2)=\{\langle 0,0\rangle,\langle 0,1\rangle,\langle 1,0\rangle,\langle 1,1\rangle\}$ and there are all but the diagonal relations are edges in the graph. Clearly $Q_n$ is just a square. | ||
| - | ==== Parents ==== | ||
| - | === Subset of === | ||
| - | [[Undirected graph]] | ||
| - | === Requirements === | ||
| - | [[Cartesian product]] | ||
