We prove that the out-distance sequence {f+(k)} of a vertex-transitive digraph of finite or infinite degree satisfies f+(k+1)≤f+(k)2 for k≥1, where f+(k) denotes the number of vertices at directed distance k from a given vertex. As a corollary, we prove that for a connected vertex-transitive undirected graph of infinite degree d, we have f(k)=d for all k, 1≤k<diam(G). This answers a question by L. Babai.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Pegden, W. Distance Sequences In Locally Infinite Vertex-Transitive Digraphs. Combinatorica 26, 577–585 (2006). https://doi.org/10.1007/s00493-006-0033-y
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/s00493-006-0033-y