Cyclic graph

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

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

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