On automorphisms of digraphs without symmetric cycles
A digraph is a symmetric cycle if it is symmetric and its underlying graph is a cycle. It is proved that if is an asymmetric digraph not containing a symmetric cycle, then remains asymmetric after removing some vertex. It is also showed that each digraph without a symmetric cycle, whose underlying graph is connected, contains a vertex which is a common fixed point of all automorphisms of .