N-Cube graph: различия между версиями

N-Cube graph (посмотреть исходный код)

194 байта добавлено , 13 ноября 2019

нет описания правки

4194

правки

@@ Строка 1: / Строка 1: @@
-'''<math>n</math>-Cube graph''' --- куб <math>n</math>-мерный.
+'''<math>n</math>-Cube graph''' — ''[[куб n-мерный|куб <math>n</math>-мерный]].''
-Consider the set <math>Q^{n} = \{(x_{1}, x_{2}, \ldots, x_{n})| \; x_{i}
+Consider the set <math>Q^{n} = \{(x_{1}, x_{2}, \ldots, x_{n})| \; x_{i}\in \{0,1\}, \; i = 1, \ldots, n\}</math>. For <math>u,v \in Q^{n}</math> the [[Hamming distance]] <math>\rho(u,v)</math> is defined as the number of entries where <math>u</math> and <math>v</math> differ. An '''<math>n</math>-cube graph''' is a [[graph, undirected graph, nonoriented graph|graph]] on the [[vertex]] set <math>Q^{n}</math>, where two vertices <math>u, v</math> are ''adjacent'' iff <math>\rho(u,v) = 1</math>.
-\in \{0,1\}, \: i = 1, \ldots, n\}</math>. For <math>u,v \in Q^{n}</math> the Hamming
+The '''<math>n</math>-cube graph''' is a ''[[regular graph]]'' with a degree <math>n-1</math>.
-distance <math>\rho(u,v)</math> is defined as the number of entries where <math>u</math> and
-<math>v</math> differ. An '''<math>n</math>-cube graph''' is a graph on the vertex set <math>Q^{n}</math>, where
+Other names are ''[[Hypercube]]'', ''[[n-Dimensional hypercube|<math>n</math>-Dimensional hypercube]]''.
-two vertices <math>u, v</math> are ''adjacent'' iff <math>\rho(u,v) = 1</math>.
-The '''<math>n</math>-cube graph''' is a ''regular graph'' with a degree <math>n-1</math>.