Consistent cycles in 1/2-arc-transitive graphs
The electronic journal of combinatorics, Tome 16 (2009) no. 1
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.
DOI :
10.37236/94
Classification :
05C25, 05C38
Mots-clés : vertex-transitve graphs, edge-transitive graphs, not arc-transitive graphs, directed cycle
Mots-clés : vertex-transitve graphs, edge-transitive graphs, not arc-transitive graphs, directed cycle
@article{10_37236_94,
author = {Marko Boben and \v{S}tefko Miklavi\v{c} and Primo\v{z} Poto\v{c}nik},
title = {Consistent cycles in 1/2-arc-transitive graphs},
journal = {The electronic journal of combinatorics},
year = {2009},
volume = {16},
number = {1},
doi = {10.37236/94},
zbl = {1159.05023},
url = {http://geodesic.mathdoc.fr/articles/10.37236/94/}
}
Marko Boben; Štefko Miklavič; Primož Potočnik. Consistent cycles in 1/2-arc-transitive graphs. The electronic journal of combinatorics, Tome 16 (2009) no. 1. doi: 10.37236/94
Cité par Sources :