Cyclic graph

Cyclic graph --- циклический граф.

The cyclic graph [math]\displaystyle{ C(n,k) }[/math] have a point set [math]\displaystyle{ V = \{0,1, \ldots,n-1\} }[/math] and lines [math]\displaystyle{ \{i,i+1\}\pmod{n} }[/math] and [math]\displaystyle{ \{i,i+k\}\pmod{n} }[/math] ([math]\displaystyle{ i = 1,\ldots,n }[/math]), where [math]\displaystyle{ k }[/math] is an integer with [math]\displaystyle{ 2 \leq k \leq n-2 }[/math]. If [math]\displaystyle{ G(n,k) }[/math] is a circulant graph, then [math]\displaystyle{ C(n,k) \simeq G(n,S) }[/math] with [math]\displaystyle{ S = \{1, \ldots,\min\{k,n-k\}\} }[/math]. The graphs [math]\displaystyle{ C(n,k) }[/math] are point-transitive 3-regular if [math]\displaystyle{ n = 2k }[/math], and 4-regular otherwise.