Geodesics in transitive graphs

3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Let P be a double ray in an infinite graph X, and let d and dp denote the distance functions in X and in P respectively. One calls P a geodesic if d(x, y) = dp(x, y), for all vertices x and y in P. We give situations when every edge of a graph belongs to a geodesic or a half-geodesic. Furthermore, we show the existence of geodesics in infinite locally-finite transitive graphs with polynomial growth which are left invariant (set-wise) under "translating" automorphisms. As the main result, we show that an infinite, locally-finite, transitive, 1-ended graph with polynomial growth is planar if and only if the complement of every geodesic has exactly two infinite components. © 1996 Academic Press, Inc.

Cite

CITATION STYLE

APA

Bonnington, C. P., Imrich, W., & Seifter, N. (1996). Geodesics in transitive graphs. Journal of Combinatorial Theory. Series B, 67(1), 12–33. https://doi.org/10.1006/jctb.1996.0031

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free