Complete rotation: различия между версиями

'''Complete rotation''' — ''[[полное вращение (орграфа)]].''

Let <math>\,G = Cay(\Gamma,S)</math> be a [[Cayley graph|Cayley]] [[digraph]] with <math>\,|S| = d</math>. (See also

''[[Associated Cayley digraph]]'').

A '''complete rotation''' of <math>\,G</math> is a group automorphism <math>\,\omega</math> of

<math>\,\Gamma</math> such that for some ordering <math>\,s_{0}, s_{1}, \ldots, s_{d-1}</math>

of the elements of <math>\,S</math>, we have <math>\,\omega(s_{i}) = s_{i+1}</math> for every <math>\,t\in Z</math>.

Clearly, a rotation is a [[graph, undirected graph, nonoriented graph|graph]] [[automorphism]]. A Cayley digraph with a complete rotation is called a '''[[rotational Cayley digraph]]'''.

 

 

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