Remarks on path-transitivity in finite graphs

Cheryl Praeger, M.D.E. Conder

    Research output: Contribution to journalArticlepeer-review

    38 Citations (Scopus)

    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 Gamma is transitive on vertices and on undirected paths of length k + 1 in Gamma, for some k greater than or equal to 1, then G is also transitive on k-arcs in Gamma. Further details are given for the case k = 1, for the case of cubic graphs, and for the case k > 4. (C) 1996 Academic Press
    Original languageEnglish
    Pages (from-to)371-378
    JournalEuropean Journal of Combinatorics
    Volume17
    DOIs
    Publication statusPublished - 1996

    Fingerprint

    Dive into the research topics of 'Remarks on path-transitivity in finite graphs'. Together they form a unique fingerprint.

    Cite this