Consistent Cycles in $1\over2$-Arc-Transitive Graphs

  • Marko Boben
  • Štefko Miklavič
  • Primož Potočnik

Abstract

A directed cycle $C$ of a graph is called $1\over k$-consistent if there exists an automorphism of the graph which acts as a $k$-step rotation of $C$. These cycles have previously been considered by several authors in the context of arc-transitive graphs. In this paper we extend these results to the case of graphs which are vertex-transitive, edge-transitive but not arc-transitive.

Published
2009-01-07
How to Cite
Boben, M., Miklavič, Štefko, & Potočnik, P. (2009). Consistent Cycles in $1\over2$-Arc-Transitive Graphs. The Electronic Journal of Combinatorics, 16(1), R5. https://doi.org/10.37236/94
Article Number
R5