On the Fastest Moving Off from a Vertex in Directed Regular Graphs
Matematičeskie zametki, Tome 82 (2007) no. 5, pp. 770-782
Voir la notice de l'article provenant de la source Math-Net.Ru
Let $\Gamma$ be a directed regular locally finite graph, and let $\overline\Gamma$ be the undirected graph obtained by forgetting the orientation of $\Gamma$. Let $x$ be a vertex of $\Gamma$ and let $n$ be a nonnegative integer. We study the length of the shortest directed path in $\Gamma$ starting at $x$ and ending outside of the ball of radius $n$ centered at $x$ in $\overline\Gamma$.
Keywords:
directed graph, undirected graph, locally finite graph
Mots-clés : automorphism group.
Mots-clés : automorphism group.
@article{MZM_2007_82_5_a10,
author = {V. I. Trofimov},
title = {On the {Fastest} {Moving} {Off} from a {Vertex} in {Directed} {Regular} {Graphs}},
journal = {Matemati\v{c}eskie zametki},
pages = {770--782},
publisher = {mathdoc},
volume = {82},
number = {5},
year = {2007},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/MZM_2007_82_5_a10/}
}
V. I. Trofimov. On the Fastest Moving Off from a Vertex in Directed Regular Graphs. Matematičeskie zametki, Tome 82 (2007) no. 5, pp. 770-782. http://geodesic.mathdoc.fr/item/MZM_2007_82_5_a10/