Associated Cayley digraph: различия между версиями

'''Associated Cayley digraph''' --- соотнесённый орграф Кэли.   

Let <math>\Gamma</math>  be a group and <math>S</math> be a generating set of <math>\Gamma</math> such that

(1) <math>e \not \in S</math>, <math>e</math> is the identity in <math>\Gamma</math>,

The '''associated Cayley digraph''' <math>Cay(\Gamma,S)</math> is a digraph

whose vertices are the elements of <math>\Gamma</math> and arcs are the

couples <math>(x,sx)</math> for <math>x \in \Gamma</math> and <math>s \in S</math>.

With this definition, <math>Cay(\Gamma,S)</math> is a connected symmetric digraph