Knödel graph

Материал из WikiGrapp
Перейти к:навигация, поиск

Knödel graphграф Кнёделя.

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

Литература

  • Евстигнеев В.А., Касьянов В.Н. Словарь по графам в информатике. — Новосибирск: Сибирское Научное Издательство, 2009.