Просмотр кода страницы Kn\"odel graph

'''Kn\"{o}del graph''' -- граф Кнёделя. 

The '''Kn\"{o'''del graph} on <math>n \geq 2</math> vertices (<math>n</math> even) and of maximum degree
<math>\Delta \geq 1</math> is denoted <math>W_{\Delta,n}</math>. The vertices of
<math>W_{\Delta,n}</math> are the couples <math>(i,j)</math> with <math>i = 1,2</math> and <math>0 \leq j
\leq \frac{n}{2} - 1</math>. For every <math>j</math>, <math>0 \leq j \leq \frac{n}{2} - 1</math>,
there is an edge between vertex <math>(1,j)</math> and every vertex <math>(2,j+2^{k} -
1\pmod{\frac{n}{2}}</math>, for <math>k = 0, \ldots, \Delta - 1</math>.