1Institute of Discrete Mathematics Vienna University of Technology Wiedner Hauptstrasse 8-10 1040 Vienna 2Department of Mathematics C Graz University of Technology Steyrergasse 30/III 8010 Graz
The electronic journal of combinatorics, Tome 19 (2012) no. 3
A rotor-router walk is a deterministic version of a random walk, in which the walker is routed to each of the neighbouring vertices in some fixed cyclic order. We consider here directed covers of graphs (called also periodic trees) and we study several quantities related to rotor-router walks on directed covers. The quantities under consideration are: order of the rotor-router group, order of the root element in the rotor-router group and the connection with random walks.
1
Institute of Discrete Mathematics
Vienna University of Technology
Wiedner Hauptstrasse 8-10
1040 Vienna
2
Department of Mathematics C
Graz University of Technology
Steyrergasse 30/III
8010 Graz
@article{10_37236_2455,
author = {Wilfried Huss and Ecaterina Sava},
title = {The rotor-router group of directed covers of graphs},
journal = {The electronic journal of combinatorics},
year = {2012},
volume = {19},
number = {3},
doi = {10.37236/2455},
zbl = {1252.05209},
url = {http://geodesic.mathdoc.fr/articles/10.37236/2455/}
}
TY - JOUR
AU - Wilfried Huss
AU - Ecaterina Sava
TI - The rotor-router group of directed covers of graphs
JO - The electronic journal of combinatorics
PY - 2012
VL - 19
IS - 3
UR - http://geodesic.mathdoc.fr/articles/10.37236/2455/
DO - 10.37236/2455
ID - 10_37236_2455
ER -
%0 Journal Article
%A Wilfried Huss
%A Ecaterina Sava
%T The rotor-router group of directed covers of graphs
%J The electronic journal of combinatorics
%D 2012
%V 19
%N 3
%U http://geodesic.mathdoc.fr/articles/10.37236/2455/
%R 10.37236/2455
%F 10_37236_2455
Wilfried Huss; Ecaterina Sava. The rotor-router group of directed covers of graphs. The electronic journal of combinatorics, Tome 19 (2012) no. 3. doi: 10.37236/2455
