Remarks on path-transitivity in finite graphs

40Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper deals with graphs the automorphism groups of which are transitive on vertices and on undirected paths (but not necessarily on directed walks) of some fixed length. In particular, it is shown that if the automorphism group G of a graph Γ is transitive on vertices and on undirected paths of length k + 1 in Γ, for some k ≥ 1, then G is also transitive on k-arcs in Γ. Further details are given for the case k = 1, for the case of cubic graphs, and for the case k > 4. © 1996 Academic Press Limited.

Cite

CITATION STYLE

APA

Conder, M. D. E., & Praeger, C. E. (1996). Remarks on path-transitivity in finite graphs. European Journal of Combinatorics, 17(4), 371–378. https://doi.org/10.1006/eujc.1996.0030

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